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 15, 2026 03:45Victor MerckléVictor MerckléScore: 6,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 03:466,96065,039,50156,767,0001,005,0002,113,536
2May 15, 2026 03:466,96367,079,18256,758,0001,038,0002,113,536
3May 15, 2026 03:466,96666,951,60557,822,00002,113,536
4May 15, 2026 03:466,96666,969,86557,818,00002,113,536
5May 15, 2026 03:466,96667,261,48556,779,0001,043,0002,113,536
6May 15, 2026 03:466,96765,122,59057,829,00002,113,536
7May 15, 2026 03:466,96965,390,48956,814,0001,035,0002,113,536
8May 15, 2026 03:466,97265,152,97356,828,0001,044,0002,113,536
9May 15, 2026 03:467,01866,269,51558,250,00002,113,536