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 14:38Victor MerckléVictor MerckléScore: 7,137Success
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 14:396,98466,408,68756,859,0001,110,0002,117,632stderr
2Aug 25, 2026 14:397,01666,626,12957,113,0001,128,0002,117,632stderr
3Aug 25, 2026 14:397,05866,984,30957,497,0001,087,0002,117,632stderr
4Aug 25, 2026 14:397,06667,018,90057,518,0001,136,0002,117,632stderr
5Aug 25, 2026 14:397,13767,610,49358,165,0001,074,0002,117,632stderr
6Aug 25, 2026 14:397,21668,325,04058,767,0001,132,0002,117,632stderr
7Aug 25, 2026 14:397,23868,447,00258,976,0001,102,0002,117,632stderr
8Aug 25, 2026 14:397,25569,677,61059,151,0001,070,0002,117,632stderr
9Aug 25, 2026 14:397,32169,152,65059,649,0001,121,0002,117,632stderr