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 20:18Danylo MocherniukDanylo MocherniukScore: 6,999Success
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 20:186,96977,595,07455,851,0001,994,0002,293,760
2Mar 29, 2026 20:186,97287,561,79455,874,0001,995,0002,506,752
3Mar 29, 2026 20:186,99186,119,53657,024,0001,000,0002,293,760
4Mar 29, 2026 20:186,99482,723,95556,052,0002,001,0002,293,760
5Mar 29, 2026 20:186,99980,012,90156,086,0002,003,0002,506,752
6Mar 29, 2026 20:187,00681,386,78457,144,0001,002,0002,506,752
7Mar 29, 2026 20:187,02880,991,39756,322,0002,011,0002,351,104
8Mar 29, 2026 20:187,05590,701,74257,551,0001,009,0002,293,760
9Mar 29, 2026 20:187,06884,012,99757,650,0001,011,0002,293,760