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 listJul 15, 2026 18:25boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 18:25094,662,03583,953,0001,005,0002,113,536expected "53692710165408851 ", got "26852797456837715 "
2Jul 15, 2026 18:250101,178,22489,254,0001,005,0002,113,536expected "53684046260663693 ", got "26916216598492557 "
3Jul 15, 2026 18:25096,633,99886,037,0001,005,0002,113,536expected "53688121481360774 ", got "26854762372789638 "