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 01:38Victor MerckléVictor MerckléScore: 7,236Success
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 01:397,19268,004,20758,492,0001,202,0002,117,632stderr
2Aug 25, 2026 01:397,21768,314,07958,799,0001,107,0002,117,632stderr
3Aug 25, 2026 01:397,22468,312,45858,850,0001,110,0002,117,632stderr
4Aug 25, 2026 01:397,22668,382,22758,830,0001,149,0002,117,632stderr
5Aug 25, 2026 01:397,23669,079,17658,915,0001,145,0002,117,632stderr
6Aug 25, 2026 01:397,24068,511,41858,985,0001,112,0002,117,632stderr
7Aug 25, 2026 01:397,24668,530,76659,027,0001,120,0002,117,632stderr
8Aug 25, 2026 01:397,25868,692,57459,125,0001,122,0002,117,632stderr
9Aug 25, 2026 01:397,30370,166,46659,527,0001,094,0002,117,632stderr