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 listMay 10, 2026 04:00Josu San MartinJosu San MartinScore: 4,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 04:004,38852,027,73735,390,0001,034,0002,547,712
2May 10, 2026 04:004,39153,867,30735,418,0001,035,0002,555,904
3May 10, 2026 04:004,39453,856,04535,452,0001,023,0002,555,904
4May 10, 2026 04:004,39656,056,69135,448,0001,044,0002,560,000
5May 10, 2026 04:004,39653,507,34735,427,0001,062,0002,539,520
6May 10, 2026 04:004,40453,003,82935,525,0001,034,0002,555,904
7May 10, 2026 04:004,40453,662,37035,515,0001,041,0002,551,808
8May 10, 2026 04:004,40453,528,87935,508,0001,052,0002,551,808
9May 10, 2026 04:004,40853,256,20035,511,0001,080,0002,551,808