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 22:06Josu San MartinJosu San MartinScore: 4,249Success
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 22:064,22843,597,70734,011,0001,082,0002,113,536
2Aug 30, 2026 22:064,23343,600,20634,024,0001,116,0002,113,536
3Aug 30, 2026 22:064,23343,709,44034,087,0001,052,0002,113,536
4Aug 30, 2026 22:064,24643,703,87134,212,0001,037,0002,113,536
5Aug 30, 2026 22:064,24943,736,21734,234,0001,035,0002,113,536
6Aug 30, 2026 22:064,25143,736,81534,164,0001,121,0002,113,536
7Aug 30, 2026 22:064,26043,781,26434,242,0001,120,0002,113,536
8Aug 30, 2026 22:064,26343,887,29434,374,0001,013,0002,113,536
9Aug 30, 2026 22:064,26543,987,02334,362,0001,044,0002,113,536