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 18:36Josu San MartinJosu San MartinScore: 3,992Success
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 18:363,95940,878,42531,785,0001,082,0002,113,536
2May 10, 2026 18:363,97442,271,84331,895,0001,094,0002,113,536
3May 10, 2026 18:363,97440,343,57831,902,0001,090,0002,113,536
4May 10, 2026 18:363,99044,931,64231,955,0001,163,0002,113,536
5May 10, 2026 18:363,99243,274,65731,959,0001,179,0002,113,536
6May 10, 2026 18:363,99542,165,16832,091,0001,071,0002,113,536
7May 10, 2026 18:364,00340,595,87232,156,0001,072,0002,113,536
8May 10, 2026 18:364,05943,302,56732,622,0001,068,0002,113,536
9May 10, 2026 18:364,07646,947,80932,701,0001,132,0002,113,536