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 30, 2026 20:32Josu San MartinJosu San MartinScore: 4,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:364,27743,935,79734,482,0001,024,0002,113,536
2Aug 30, 2026 20:364,28944,061,59934,575,0001,025,0002,113,536
3Aug 30, 2026 20:364,29244,041,27134,514,0001,112,0002,113,536
4Aug 30, 2026 20:364,29344,072,64034,528,0001,112,0002,113,536
5Aug 30, 2026 20:364,29644,050,08634,623,0001,036,0002,113,536
6Aug 30, 2026 20:364,30544,179,85034,612,0001,120,0002,113,536
7Aug 30, 2026 20:364,30745,758,67034,637,0001,116,0002,113,536
8Aug 30, 2026 20:364,30944,201,65734,724,0001,046,0002,113,536
9Aug 30, 2026 20:364,31444,297,20834,681,0001,129,0002,113,536