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 29, 2026 14:44Danylo MocherniukDanylo MocherniukScore: 11,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 14:4411,767127,424,46896,660,0001,006,0002,506,752
2Mar 29, 2026 14:4411,784121,498,05395,811,0001,996,0002,510,848
3Mar 29, 2026 14:4411,784127,447,82596,813,000998,0002,293,760
4Mar 29, 2026 14:4411,785122,529,65496,821,000998,0002,293,760
5Mar 29, 2026 14:4411,785126,155,45695,823,0001,996,0002,293,760
6Mar 29, 2026 14:4411,786123,754,47995,827,0001,996,0002,510,848
7Mar 29, 2026 14:4411,787128,196,89396,833,000998,0002,293,760
8Mar 29, 2026 14:4411,790125,420,64896,860,000998,0002,293,760
9Mar 29, 2026 14:4411,810123,751,81596,024,0002,000,0002,293,760