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 listMay 14, 2026 04:16Victor MerckléVictor MerckléScore: 7,060Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 04:167,05367,806,64558,545,00002,113,536
2May 14, 2026 04:167,05566,659,24758,557,00002,113,536
3May 14, 2026 04:167,05566,575,60358,561,00002,113,536
4May 14, 2026 04:167,05766,398,98457,572,0001,006,0002,113,536
5May 14, 2026 04:167,06067,328,59457,600,0001,003,0002,113,536
6May 14, 2026 04:167,11369,878,97159,042,00002,113,536
7May 14, 2026 04:167,11366,759,47459,042,00002,113,536
8May 14, 2026 04:167,11968,111,27058,088,0001,003,0002,113,536
9May 14, 2026 04:167,21668,925,74659,897,00002,113,536