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 25, 2026 02:32Victor MerckléVictor MerckléScore: 7,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 02:337,32569,182,96459,638,0001,161,0002,117,632stderr
2Aug 25, 2026 02:337,34069,408,79459,786,0001,139,0002,117,632stderr
3Aug 25, 2026 02:337,35269,435,60159,939,0001,088,0002,117,632stderr
4Aug 25, 2026 02:337,35369,402,79459,950,0001,080,0002,117,632stderr
5Aug 25, 2026 02:337,37269,572,23060,095,0001,099,0002,117,632stderr
6Aug 25, 2026 02:337,37569,603,25060,113,0001,100,0002,117,632stderr
7Aug 25, 2026 02:337,38469,648,96260,209,0001,086,0002,117,632stderr
8Aug 25, 2026 02:337,40269,876,73460,333,0001,106,0002,117,632stderr
9Aug 25, 2026 02:337,41870,056,70260,555,0001,016,0002,117,632stderr