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 listAug 29, 2026 17:08Josu San MartinJosu San MartinScore: 4,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 17:094,50345,840,78236,263,0001,120,0002,113,536
2Aug 29, 2026 17:094,50745,870,15736,277,0001,135,0002,113,536
3Aug 29, 2026 17:094,50846,001,87636,287,0001,132,0002,113,536
4Aug 29, 2026 17:094,52145,960,48836,399,0001,127,0002,113,536
5Aug 29, 2026 17:094,52746,937,02736,546,0001,036,0002,113,536
6Aug 29, 2026 17:094,52846,060,98936,446,0001,144,0002,113,536
7Aug 29, 2026 17:094,54546,255,55636,597,0001,127,0002,113,536
8Aug 29, 2026 17:094,54646,168,00836,621,0001,113,0002,113,536
9Aug 29, 2026 17:094,73647,773,11138,266,0001,046,0002,113,536