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 07:12Kevin HeaveyKevin HeaveyScore: 10,188Success
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 07:1210,06993,101,56882,428,0001,146,0002,117,632
2Jul 6, 2026 07:1210,07893,167,80282,509,0001,141,0002,117,632
3Jul 6, 2026 07:1210,10093,390,41082,610,0001,225,0002,117,632
4Jul 6, 2026 07:1210,14493,734,42883,016,0001,187,0002,117,632
5Jul 6, 2026 07:1210,18894,100,00783,415,0001,147,0002,117,632
6Jul 6, 2026 07:1210,19894,149,98483,500,0001,147,0002,117,632
7Jul 6, 2026 07:1210,25794,677,15384,002,0001,137,0002,117,632
8Jul 6, 2026 07:1210,27194,798,54584,115,0001,141,0002,117,632
9Jul 6, 2026 07:1210,35195,492,69484,763,0001,154,0002,117,632