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 22, 2026 10:04Kevin HeaveyKevin HeaveyScore: 68,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 10:124,74249,296,34137,087,0002,274,0002,117,632
2Jul 22, 2026 10:1267,045570,161,947554,472,0002,007,0002,117,632
3Jul 22, 2026 10:1267,248568,100,342556,154,0002,009,0002,117,632
4Jul 22, 2026 10:1268,010574,459,409562,349,0002,137,0002,117,632
5Jul 22, 2026 10:1268,581584,679,094567,154,0002,071,0002,117,632
6Jul 22, 2026 10:1268,617579,561,194567,389,0002,139,0002,117,632
7Jul 22, 2026 10:1269,224585,459,461572,439,0002,123,0002,121,728
8Jul 22, 2026 10:1272,057613,715,547596,035,0002,039,0002,117,632
9Jul 22, 2026 10:1272,546612,090,460600,093,0002,040,0002,121,728