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 31, 2026 21:56George SeabridgeGeorge SeabridgeScore: 8,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 21:588,89483,842,99172,738,0001,084,0002,113,536
2Jul 31, 2026 21:588,90483,913,35372,819,0001,085,0002,113,536
3Jul 31, 2026 21:588,90883,944,29072,866,0001,076,0002,113,536
4Jul 31, 2026 21:588,92084,086,60372,961,0001,080,0002,113,536
5Jul 31, 2026 21:588,99284,644,73973,547,0001,090,0002,113,536
6Jul 31, 2026 21:589,02284,944,45573,607,0001,279,0002,113,536
7Jul 31, 2026 21:589,05385,237,88173,940,0001,200,0002,113,536
8Jul 31, 2026 21:589,05685,177,30974,086,0001,087,0002,113,536
9Jul 31, 2026 21:589,11185,715,77274,517,0001,107,0002,113,536