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 29, 2026 14:05Victor MerckléVictor MerckléScore: 4,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 14:094,31649,517,69934,767,0001,062,0002,117,632stderr
2Aug 29, 2026 14:094,33051,346,81734,856,0001,087,0002,117,632stderr
3Aug 29, 2026 14:094,34544,500,07934,982,0001,082,0002,117,632stderr
4Aug 29, 2026 14:094,34544,465,64834,985,0001,084,0002,117,632stderr
5Aug 29, 2026 14:094,34644,393,49234,982,0001,095,0002,117,632stderr
6Aug 29, 2026 14:094,35344,490,79335,032,0001,103,0002,117,632stderr
7Aug 29, 2026 14:094,35844,578,82735,146,0001,032,0002,117,632stderr
8Aug 29, 2026 14:094,36052,336,81835,059,0001,134,0002,117,632stderr
9Aug 29, 2026 14:094,36244,540,10534,989,0001,218,0002,117,632stderr