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 listJan 2, 2026 22:24Josu San MartinJosu San MartinScore: 5,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 22:245,37374,088,67843,609,000991,0002,281,472
2Jan 2, 2026 22:245,47868,151,84144,460,0001,010,0002,289,664
3Jan 2, 2026 22:245,74176,011,37547,647,00002,289,664
4Jan 2, 2026 22:245,77078,873,79245,893,0001,995,0002,293,760
5Jan 2, 2026 22:245,84478,809,30147,494,0001,010,0002,285,568
6Jan 2, 2026 22:245,89185,992,62346,900,0001,995,0002,363,392