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 listJan 31, 2026 11:52olliecrowolliecrowScore: 8,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 11:526,77389,645,30350,191,0006,022,0002,490,368
2Jan 31, 2026 11:526,82778,309,18950,703,0005,965,0002,330,624
3Jan 31, 2026 11:526,87288,193,36749,035,0008,005,0002,490,368
4Jan 31, 2026 11:528,056100,607,94958,879,0007,983,0002,531,328
5Jan 31, 2026 11:528,12797,411,04561,499,0005,951,0002,383,872
6Jan 31, 2026 11:528,24097,320,42562,443,0005,947,0002,322,432