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 listMar 10, 2026 16:10Josu San MartinJosu San MartinScore: 11,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 16:109,129100,513,41274,773,000996,0002,482,176
2Mar 10, 2026 16:109,192102,657,91075,288,0001,003,0002,387,968
3Mar 10, 2026 16:109,39098,302,04775,937,0001,998,0002,379,776
4Mar 10, 2026 16:1011,122118,174,35591,310,0001,003,0002,383,872
5Mar 10, 2026 16:1011,217123,049,88191,100,0002,002,0002,281,472
6Mar 10, 2026 16:1011,439119,096,77992,949,0001,998,0002,281,472