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 listFeb 18, 2026 23:44Josu San MartinJosu San MartinScore: 6,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 23:446,02170,091,34947,973,0001,998,0002,285,568
2Feb 18, 2026 23:446,12180,290,62646,820,0003,984,0002,514,944
3Feb 18, 2026 23:446,30877,586,96550,342,0002,013,0002,338,816
4Feb 18, 2026 23:446,36180,370,80149,807,0002,988,0002,301,952
5Feb 18, 2026 23:446,36776,130,53951,850,000997,0002,289,664
6Feb 18, 2026 23:446,48087,710,31850,796,0002,988,0002,269,184