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 2, 2026 15:48George SeabridgeGeorge SeabridgeScore: 10,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 15:4810,40996,372,04585,265,0001,137,0002,113,536
2Aug 2, 2026 15:4810,40997,152,84285,199,0001,200,0002,113,536
3Aug 2, 2026 15:4810,44496,618,80685,460,0001,227,0002,113,536
4Aug 2, 2026 15:4810,45796,667,98585,600,0001,195,0002,113,536
5Aug 2, 2026 15:4810,46396,863,65685,629,0001,216,0002,113,536
6Aug 2, 2026 15:4810,55799,645,96586,348,0001,279,0002,113,536
7Aug 2, 2026 15:4810,63498,300,12887,254,0001,013,0002,113,536
8Aug 2, 2026 15:4810,714100,415,70787,729,0001,200,0002,113,536
9Aug 2, 2026 15:4846,019392,673,811380,727,0001,232,0002,113,536