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 19:59Josu San MartinJosu San MartinScore: 5,066Success
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 19:594,92862,050,69138,906,0001,995,0002,506,752
2Mar 10, 2026 19:594,95062,663,49839,079,0002,004,0002,412,544
3Mar 10, 2026 19:594,95565,931,60039,121,0002,006,0002,420,736
4Mar 10, 2026 19:595,01164,240,99640,575,0001,014,0002,281,472
5Mar 10, 2026 19:595,01869,752,70440,632,0001,015,0002,281,472
6Mar 10, 2026 19:595,02267,846,03840,668,0001,016,0002,281,472
7Mar 10, 2026 19:595,06663,174,47741,044,0001,001,0002,490,368
8Mar 10, 2026 19:595,09467,060,26140,267,0002,013,0002,281,472
9Mar 10, 2026 19:595,24669,220,46242,533,0001,012,0002,400,256
10Mar 10, 2026 19:595,25470,646,73042,591,0001,014,0002,412,544
11Mar 10, 2026 19:595,31474,514,46142,100,0002,004,0002,404,352
12Mar 10, 2026 19:595,34968,697,42643,390,0001,009,0002,281,472