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 listApr 27, 2026 04:42wnwnScore: 3,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 04:423,41347,053,53027,317,0001,011,0002,473,984
2Apr 27, 2026 04:423,43742,887,39127,510,0001,018,0002,486,272
3Apr 27, 2026 04:423,44547,158,30427,580,0001,021,0002,478,080
4Apr 27, 2026 04:423,46650,276,04226,787,0001,984,0002,478,080
5Apr 27, 2026 04:423,46643,826,95826,789,0001,984,0002,494,464
6Apr 27, 2026 04:423,55349,870,31528,481,0001,017,0002,486,272
7Apr 27, 2026 04:423,56247,564,85228,552,0001,019,0002,482,176
8Apr 27, 2026 04:423,62546,286,83428,085,0002,006,0002,486,272
9Apr 27, 2026 04:423,64947,083,07729,285,0001,009,0002,482,176