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:16Danylo MocherniukDanylo MocherniukScore: 12,222Success
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:1412,206122,959,59799,305,0002,006,0002,510,848
2Mar 29, 2026 14:1412,210123,212,107100,337,0001,003,0002,519,040
3Mar 29, 2026 14:1612,210124,803,24499,339,0002,006,0002,510,848
4Mar 29, 2026 14:1612,215125,955,18999,377,0002,007,0002,506,752
5Mar 29, 2026 14:1612,222124,162,71999,437,0002,008,0002,502,656
6Mar 29, 2026 14:1612,225129,061,074100,461,0001,004,0002,498,560
7Mar 29, 2026 14:1412,243129,377,516101,614,00002,293,760
8Mar 29, 2026 14:1612,303128,212,302101,113,0001,001,0002,519,040
9Mar 29, 2026 14:1612,408129,839,989100,990,0001,999,0002,293,760