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 listJul 18, 2026 10:52boop34boop34Score: 9,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 10:529,11885,354,06174,676,0001,008,0002,113,536
2Jul 18, 2026 10:529,14885,677,69674,924,0001,008,0002,113,536
3Jul 18, 2026 10:529,16786,268,82375,071,0001,016,0002,113,536
4Jul 18, 2026 10:529,17085,812,47075,018,0001,097,0002,113,536
5Jul 18, 2026 10:529,18685,916,83375,243,0001,005,0002,113,536
6Jul 18, 2026 10:529,20286,114,95575,271,0001,110,0002,113,536
7Jul 18, 2026 10:529,22486,300,48775,515,0001,049,0002,113,536
8Jul 18, 2026 10:529,39487,724,89976,934,0001,042,0002,113,536
9Jul 18, 2026 10:529,43189,231,87677,268,0001,017,0002,113,536