Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 30, 2026 18:43Josu San MartinJosu San MartinScore: 4,716Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:434,69947,461,19937,938,0001,070,0002,113,536
2Aug 30, 2026 18:434,70247,470,06038,008,0001,023,0002,113,536
3Aug 30, 2026 18:434,70247,500,39637,877,0001,156,0002,113,536
4Aug 30, 2026 18:434,71547,563,71838,106,0001,032,0002,113,536
5Aug 30, 2026 18:434,71648,285,71037,981,0001,169,0002,113,536
6Aug 30, 2026 18:434,72047,727,58338,070,0001,107,0002,113,536
7Aug 30, 2026 18:434,72247,641,85538,181,0001,013,0002,113,536
8Aug 30, 2026 18:434,72347,627,58138,036,0001,170,0002,113,536
9Aug 30, 2026 18:434,79748,292,48338,805,0001,018,0002,113,536