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 listMay 10, 2026 11:12wnwnScore: 7,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:127,16074,209,58958,375,0001,055,0002,482,176
2May 10, 2026 11:127,17373,237,41158,489,0001,051,0002,478,080
3May 10, 2026 11:127,18674,240,58758,592,0001,058,0002,486,272
4May 10, 2026 11:127,30578,113,61659,565,0001,069,0002,486,272
5May 10, 2026 11:127,31675,647,06059,651,0001,074,0002,486,272
6May 10, 2026 11:127,31977,329,57559,696,0001,055,0002,478,080
7May 10, 2026 11:127,31977,647,52159,663,0001,092,0002,478,080
8May 10, 2026 11:127,32376,253,61659,689,0001,095,0002,486,272
9May 10, 2026 11:127,32476,469,37059,719,0001,072,0002,494,464