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 listFeb 23, 2026 19:52wnwnScore: 4,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 20:414,41467,171,60035,616,0001,017,0002,535,424
2Feb 23, 2026 19:534,43766,472,40335,832,000995,0002,494,464
3Feb 23, 2026 19:524,43858,773,70534,844,0001,991,0002,494,464
4Feb 23, 2026 19:534,44162,506,60634,872,0001,992,0002,535,424
5Feb 23, 2026 20:414,45559,620,92234,978,0001,998,0002,535,424
6Feb 23, 2026 19:534,46458,973,03635,048,0002,002,0002,527,232
7Feb 23, 2026 20:414,47559,380,90535,132,0002,007,0002,273,280
8Feb 23, 2026 19:524,50659,888,50536,390,0001,010,0002,478,080
9Feb 23, 2026 19:524,51562,184,03436,463,0001,012,0002,486,272