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 12, 2026 14:32Kevin HeaveyKevin HeaveyScore: 4,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 14:334,86650,022,53339,209,0001,184,0002,117,632
2Jul 12, 2026 14:334,86850,099,51639,199,0001,213,0002,117,632
3Jul 12, 2026 14:334,88950,215,96739,369,0001,212,0002,117,632
4Jul 12, 2026 14:334,89450,280,86139,429,0001,197,0002,117,632
5Jul 12, 2026 14:334,89750,252,20539,631,0001,021,0002,117,632
6Jul 12, 2026 14:334,91150,405,77639,604,0001,159,0002,117,632
7Jul 12, 2026 14:334,91950,469,73239,642,0001,187,0002,117,632
8Jul 12, 2026 14:334,92050,520,20039,655,0001,185,0002,117,632
9Jul 12, 2026 14:335,09553,406,07941,092,0001,204,0002,117,632