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 listMar 18, 2026 09:55wnwnScore: 4,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 09:544,28055,308,86934,510,0001,015,0002,273,280
2Mar 18, 2026 09:554,31962,935,51233,858,0001,991,0002,498,560
3Mar 18, 2026 09:534,32059,060,68133,868,0001,992,0002,531,328
4Mar 18, 2026 09:534,32266,832,03633,881,0001,993,0002,273,280
5Mar 18, 2026 09:544,32458,866,29933,896,0001,993,0002,494,464
6Mar 18, 2026 09:554,32559,357,72333,906,0001,994,0002,273,280
7Mar 18, 2026 09:534,32656,189,05933,911,0001,994,0002,273,280
8Mar 18, 2026 09:554,33456,556,91333,974,0001,998,0002,486,272
9Mar 18, 2026 09:544,34057,522,80034,021,0002,001,0002,273,280