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 listDec 22, 2025 03:30Josu San MartinJosu San MartinScore: 42,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 03:3042,108383,756,432349,496,00002,260,992
2Dec 22, 2025 03:3142,109375,780,668349,506,00002,379,776
3Dec 22, 2025 03:3142,110378,201,776349,514,00002,379,776
4Dec 22, 2025 03:3042,127375,298,337346,661,0002,997,0002,523,136
5Dec 22, 2025 03:3042,129375,550,717347,671,0001,998,0002,523,136
6Dec 22, 2025 03:3142,130376,430,842348,681,0001,001,0002,523,136