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:10Josu San MartinJosu San MartinScore: 4,381Success
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:114,37351,697,39435,276,0001,028,0002,560,000
2May 10, 2026 04:114,37451,710,06035,275,0001,033,0002,555,904
3May 10, 2026 04:114,37651,095,75635,289,0001,039,0002,551,808
4May 10, 2026 04:114,37653,652,19535,304,0001,024,0002,555,904
5May 10, 2026 04:114,38153,168,48735,309,0001,055,0002,543,616
6May 10, 2026 04:114,38252,411,85135,348,0001,026,0002,547,712
7May 10, 2026 04:114,38351,700,60335,155,0001,227,0002,297,856
8May 10, 2026 04:114,39753,558,45235,425,0001,071,0002,551,808
9May 10, 2026 04:114,41053,927,80535,486,0001,120,0002,547,712