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 7, 2026 05:04Victor MerckléVictor MerckléScore: 34,009Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:0633,959290,410,031280,849,0001,016,0002,117,632stderr
2Jul 7, 2026 05:0633,990290,230,366281,032,0001,089,0002,117,632stderr
3Jul 7, 2026 05:0633,999290,366,966281,027,0001,172,0002,117,632stderr
4Jul 7, 2026 05:0634,006290,418,139281,126,0001,131,0002,117,632stderr
5Jul 7, 2026 05:0634,009290,367,815281,165,0001,113,0002,117,632stderr
6Jul 7, 2026 05:0634,016290,496,556281,157,0001,184,0002,117,632stderr
7Jul 7, 2026 05:0634,073290,920,803281,801,0001,007,0002,117,632stderr
8Jul 7, 2026 05:0634,092291,134,006281,965,0001,003,0002,117,632stderr
9Jul 7, 2026 05:0634,159292,167,537282,521,0001,005,0002,117,632stderr