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 6, 2026 04:23Teow Hua JunTeow Hua JunScore: 12,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 04:2312,371112,250,04691,954,00010,733,0002,117,632stderr
2Jul 6, 2026 04:2312,457112,994,42592,932,00010,464,0002,117,632stderr
3Jul 6, 2026 04:2312,463113,110,78293,041,00010,406,0002,117,632stderr
4Jul 6, 2026 04:2312,527113,533,61193,127,00010,848,0002,117,632stderr
5Jul 6, 2026 04:2312,573114,435,88493,229,00011,130,0002,117,632stderr
6Jul 6, 2026 04:2312,586114,486,67693,119,00011,349,0002,117,632stderr
7Jul 6, 2026 04:2312,597114,606,56093,016,00011,545,0002,117,632stderr
8Jul 6, 2026 04:2312,613114,251,85993,112,00011,581,0002,117,632stderr
9Jul 6, 2026 04:2312,623114,779,62193,556,00011,218,0002,117,632stderr