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 13:12Danylo MocherniukDanylo MocherniukScore: 19,936Success
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 13:1219,443184,209,915160,379,0001,002,0002,502,656
2Mar 29, 2026 13:1219,447186,668,324160,407,0001,002,0002,293,760
3Mar 29, 2026 13:1219,463191,659,317160,548,000997,0002,510,848
4Mar 29, 2026 13:1219,486195,341,186160,738,000998,0002,502,656
5Mar 29, 2026 13:1219,936196,525,958164,468,0001,002,0002,293,760
6Mar 29, 2026 13:1219,938185,453,514164,486,0001,002,0002,293,760
7Mar 29, 2026 13:1219,952192,841,990165,602,00002,506,752
8Mar 29, 2026 13:1219,969191,749,496163,743,0001,996,0002,293,760
9Mar 29, 2026 13:1219,979188,821,317163,829,0001,997,0002,506,752