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 00:11Victor MerckléVictor MerckléScore: 3,948Success
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 00:123,91840,865,76431,472,0001,050,0002,117,632stderr
2Aug 25, 2026 00:123,92740,989,95131,571,0001,027,0002,117,632stderr
3Aug 25, 2026 00:123,93841,028,67531,661,0001,027,0002,117,632stderr
4Aug 25, 2026 00:123,94741,134,88031,738,0001,030,0002,117,632stderr
5Aug 25, 2026 00:123,94841,193,77231,736,0001,033,0002,117,632stderr
6Aug 25, 2026 00:123,96341,276,66931,869,0001,031,0002,117,632stderr
7Aug 25, 2026 00:124,01442,087,86432,293,0001,030,0002,117,632stderr
8Aug 25, 2026 00:124,06342,715,71132,700,0001,029,0002,117,632stderr
9Aug 25, 2026 00:124,14542,884,14433,377,0001,030,0002,117,632stderr