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 10, 2026 18:27Sergey SerebryakovSergey SerebryakovScore: 7,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 18:277,59284,603,50561,010,0002,000,0002,265,088
2Mar 10, 2026 18:277,59288,977,18862,017,0001,000,0002,265,088
3Mar 10, 2026 18:277,59589,980,59259,037,0004,002,0002,400,256
4Mar 10, 2026 18:277,95193,525,92062,998,0002,999,0002,265,088
5Mar 10, 2026 18:277,95690,141,57164,036,0002,001,0002,265,088
6Mar 10, 2026 18:277,95795,046,45463,039,0003,001,0002,265,088
7Mar 10, 2026 18:277,95788,412,17765,047,0001,000,0002,392,064
8Mar 10, 2026 18:277,95992,431,28464,060,0002,001,0002,265,088
9Mar 10, 2026 18:277,96094,001,22363,068,0003,003,0002,506,752
10Mar 10, 2026 18:277,96187,322,88464,075,0002,002,0002,404,352
11Mar 10, 2026 18:277,96392,484,98165,088,0001,001,0002,265,088
12Mar 10, 2026 18:277,96886,119,18363,130,0003,006,0002,396,160