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 listAug 1, 2026 13:01George SeabridgeGeorge SeabridgeScore: 8,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 13:016,82866,687,50855,592,0001,084,0002,113,536
2Aug 1, 2026 13:016,98567,997,05056,832,0001,145,0002,113,536
3Aug 1, 2026 13:018,11377,373,35866,332,0001,012,0002,113,536
4Aug 1, 2026 13:018,14578,341,35166,517,0001,088,0002,113,536
5Aug 1, 2026 13:018,14577,639,86166,523,0001,086,0002,113,536
6Aug 1, 2026 13:018,15577,678,06966,656,0001,031,0002,113,536
7Aug 1, 2026 13:018,15777,684,67666,626,0001,078,0002,113,536
8Aug 1, 2026 13:018,17177,811,31266,734,0001,093,0002,113,536
9Aug 1, 2026 13:018,18877,908,66566,948,0001,016,0002,113,536