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 listMar 2, 2026 15:19caandocaandoScore: 5,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 11:065,57770,483,50144,281,0002,012,0002,523,136
2Nov 5, 2025 11:065,59063,346,74045,389,0001,008,0002,285,568
3Mar 2, 2026 15:195,59168,925,02245,400,0001,008,0002,523,136
4Nov 5, 2025 11:065,62477,151,38645,665,0001,014,0002,285,568
5Mar 2, 2026 15:195,64474,859,47944,856,0001,993,0002,277,376
6Mar 2, 2026 15:195,67070,831,70244,058,0003,004,0002,285,568
7Mar 2, 2026 15:195,68668,783,10646,193,0001,004,0002,285,568
8Nov 5, 2025 11:065,69269,278,81545,236,0002,010,0002,514,944
9Nov 5, 2025 11:065,70171,954,07946,316,0001,006,0002,285,568
10Nov 5, 2025 11:065,70568,875,55246,344,0001,007,0002,514,944
11Mar 2, 2026 15:195,72266,814,35646,485,0001,010,0002,523,136
12Mar 2, 2026 15:195,81472,653,16246,249,0002,010,0002,519,040