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 16, 2026 09:04boop34boop34Score: 9,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 09:049,00384,364,57673,726,0001,007,0002,113,536
2Jul 16, 2026 09:049,00984,329,73873,766,0001,009,0002,113,536
3Jul 16, 2026 09:049,00984,363,27973,759,0001,021,0002,113,536
4Jul 16, 2026 09:049,01084,265,80673,777,0001,012,0002,113,536
5Jul 16, 2026 09:049,01584,624,94773,819,0001,007,0002,113,536
6Jul 16, 2026 09:049,01684,372,26673,827,0001,010,0002,113,536
7Jul 16, 2026 09:049,11585,319,98574,652,0001,009,0002,113,536
8Jul 16, 2026 09:049,21286,030,39875,456,0001,011,0002,113,536
9Jul 16, 2026 09:049,34287,037,16376,536,0001,007,0002,113,536