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 7, 2026 08:35wnwnScore: 3,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:353,39243,526,93627,111,0001,049,0002,486,272
2May 7, 2026 08:353,39244,978,75927,100,0001,060,0002,482,176
3May 7, 2026 08:353,42643,552,39227,326,0001,115,0002,490,368
4May 7, 2026 08:353,44245,605,40227,458,0001,117,0002,482,176
5May 7, 2026 08:353,49945,198,88927,959,0001,084,0002,486,272
6May 7, 2026 08:353,54446,584,54228,347,0001,076,0002,478,080
7May 7, 2026 08:353,56544,829,38228,526,0001,067,0002,498,560
8May 7, 2026 08:353,57643,641,56828,622,0001,063,0002,490,368
9May 7, 2026 08:353,58447,013,28528,686,0001,062,0002,486,272