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 03:34Josu San MartinJosu San MartinScore: 4,422Success
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 03:344,38551,649,04335,295,0001,104,0002,551,808
2May 10, 2026 03:344,40053,355,44435,494,0001,026,0002,543,616
3May 10, 2026 03:344,40054,371,79635,373,0001,149,0002,543,616
4May 10, 2026 03:344,40753,615,51935,432,0001,149,0002,293,760
5May 10, 2026 03:344,42252,805,40735,589,0001,116,0002,555,904
6May 10, 2026 03:344,42353,243,51135,684,0001,033,0002,539,520
7May 10, 2026 03:344,42653,977,19035,630,0001,107,0002,555,904
8May 10, 2026 03:344,45150,752,78135,907,0001,039,0002,543,616
9May 10, 2026 03:344,45152,227,68135,840,0001,107,0002,551,808