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 listJul 17, 2026 18:59boop34boop34Score: 9,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 18:599,70990,197,45279,582,0001,006,0002,113,536
2Jul 17, 2026 18:599,71390,922,91179,619,0001,006,0002,113,536
3Jul 17, 2026 18:599,72490,443,38979,703,0001,008,0002,113,536
4Jul 17, 2026 18:599,84091,319,32880,649,0001,030,0002,113,536
5Jul 17, 2026 18:599,93893,113,99381,483,0001,005,0002,113,536
6Jul 17, 2026 18:599,97292,512,46681,769,0001,006,0002,113,536
7Jul 17, 2026 18:599,98492,803,93981,832,0001,039,0002,113,536
8Jul 17, 2026 18:5910,13593,843,32983,092,0001,029,0002,113,536
9Jul 17, 2026 18:5910,15794,590,53183,277,0001,033,0002,113,536