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 12:09Danylo MocherniukDanylo MocherniukScore: 31,805Success
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 12:0930,574281,667,221250,769,0002,997,0002,502,656
2Mar 29, 2026 12:0930,585281,282,077250,856,0002,998,0002,281,472
3Mar 29, 2026 12:0931,792285,234,809261,873,0001,999,0002,510,848
4Mar 29, 2026 12:0931,797287,293,280261,915,0001,999,0002,506,752
5Mar 29, 2026 12:0931,805290,685,675262,983,000999,0002,281,472
6Mar 29, 2026 12:0931,816287,457,102262,072,0002,000,0002,281,472
7Mar 29, 2026 12:0931,827285,973,431261,161,0003,001,0002,510,848
8Mar 29, 2026 12:0931,830287,547,573261,186,0003,002,0002,281,472
9Mar 29, 2026 12:0931,853296,069,703262,381,0002,002,0002,510,848