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 listMar 8, 2026 06:00caandocaandoScore: 9,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 06:008,46293,074,53568,230,0002,006,0002,281,472
2Mar 8, 2026 06:008,46289,058,03968,232,0002,006,0002,523,136
3Mar 8, 2026 06:008,48590,939,22369,420,0001,006,0002,281,472
4Mar 8, 2026 06:009,410111,376,37276,100,0002,002,0002,281,472
5Mar 8, 2026 06:009,411105,526,26376,107,0002,002,0002,281,472
6Mar 8, 2026 06:009,424101,052,49376,213,0002,005,0002,281,472