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 26, 2026 17:19zielajzielajScore: 3,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 17:203,44342,670,99827,557,0001,020,0002,424,832
2Apr 26, 2026 17:203,45742,795,79027,674,0001,024,0002,424,832
3Apr 26, 2026 17:203,45948,928,07026,736,0001,980,0002,420,736
4Apr 26, 2026 17:203,46748,536,07827,790,000992,0002,437,120
5Apr 26, 2026 17:203,47246,276,00026,832,0001,987,0002,420,736
6Apr 26, 2026 17:203,49145,071,59326,985,0001,998,0002,424,832
7Apr 26, 2026 17:203,53951,417,52528,368,0001,013,0002,437,120
8Apr 26, 2026 17:203,58346,675,34228,722,0001,025,0002,420,736
9Apr 26, 2026 17:203,62246,316,49528,063,0002,004,0002,428,928