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:46Sergey SerebryakovSergey SerebryakovScore: 9,274Success
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:468,903100,266,51571,899,0001,997,0002,273,280
2Mar 10, 2026 16:468,91395,189,62171,976,0001,999,0002,273,280
3Mar 10, 2026 16:468,94995,731,38072,266,0002,007,0002,404,352
4Mar 10, 2026 16:469,274102,140,24474,977,0001,999,0002,273,280
5Mar 10, 2026 16:469,28597,736,01575,062,0002,001,0002,396,160
6Mar 10, 2026 16:469,29098,170,09875,107,0002,002,0002,392,064