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 listOct 21, 2026 17:38timothygktimothygkScore: 40,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 17:3940,573347,712,222331,413,0005,351,0002,117,632stderr
2Oct 21, 2026 17:3940,581347,811,581331,446,0005,382,0002,117,632stderr
3Oct 21, 2026 17:3940,742349,763,844332,456,0005,705,0002,117,632stderr
4Oct 21, 2026 17:3940,849350,416,592333,684,0005,369,0002,117,632stderr
5Oct 21, 2026 17:3940,886350,885,640333,242,0006,116,0002,117,632stderr
6Oct 21, 2026 17:3940,928351,206,576334,064,0005,644,0002,117,632stderr
7Oct 21, 2026 17:3941,269353,455,545337,171,0005,367,0002,117,632stderr
8Oct 21, 2026 17:3941,281353,600,773337,278,0005,355,0002,117,632stderr
9Oct 21, 2026 17:3941,353355,495,274337,886,0005,352,0002,117,632stderr