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 13, 2026 18:07boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 18:070159,640,471148,755,0001,012,0002,113,536expected "53685675074115082 ", got "The number of chunks with more than 3 newlines: 2 1444659886 "
2Jul 13, 2026 18:070159,438,344148,737,0001,012,0002,117,632expected "53690842828930591 ", got "The number of chunks with more than 3 newlines: 2 2194838217 "
3Jul 13, 2026 18:070160,016,051148,698,0001,012,0002,113,536expected "53684311303448498 ", got "The number of chunks with more than 3 newlines: 0 2882496093 "