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 21, 2026 19:36Kevin HeaveyKevin HeaveyScore: 10,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 19:3610,28595,034,64983,123,0002,247,0002,117,632
2Jul 21, 2026 19:3610,30095,127,08783,230,0002,267,0002,117,632
3Jul 21, 2026 19:3610,30595,187,67583,268,0002,266,0002,117,632
4Jul 21, 2026 19:3610,32895,411,68783,441,0002,282,0002,117,632
5Jul 21, 2026 19:3610,34095,479,76683,500,0002,329,0002,117,632
6Jul 21, 2026 19:3610,388104,779,42583,924,0002,303,0002,117,632
7Jul 21, 2026 19:3610,41496,034,92184,128,0002,310,0002,117,632
8Jul 21, 2026 19:3610,71798,661,36386,689,0002,264,0002,117,632
9Jul 21, 2026 19:3610,78499,101,54287,233,0002,277,0002,117,632