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 17, 2026 21:52Josu San MartinJosu San MartinScore: 5,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 22:005,09950,776,66141,298,0001,025,0002,138,112
2Aug 17, 2026 22:005,10050,753,61541,298,0001,037,0002,138,112
3Aug 17, 2026 22:005,10350,936,93541,318,0001,042,0002,138,112
4Aug 17, 2026 22:005,10350,804,84741,334,0001,023,0002,138,112
5Aug 17, 2026 22:005,10450,947,67041,325,0001,044,0002,138,112
6Aug 17, 2026 22:005,10850,848,43641,373,0001,025,0002,138,112
7Aug 17, 2026 22:005,11150,767,79441,400,0001,023,0002,138,112
8Aug 17, 2026 22:005,11750,840,73541,444,0001,030,0002,138,112
9Aug 17, 2026 22:005,12051,603,99441,472,0001,030,0002,138,112