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 09:58Victor MerckléVictor MerckléScore: 5,711Success
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 10:015,61454,910,80745,573,0001,024,0002,117,632stderr
2Aug 29, 2026 10:015,64455,184,85845,803,0001,045,0002,117,632stderr
3Aug 29, 2026 10:015,69955,643,77146,274,0001,032,0002,117,632stderr
4Aug 29, 2026 10:015,70156,338,16446,284,0001,037,0002,117,632stderr
5Aug 29, 2026 10:015,71157,008,89946,365,0001,037,0002,117,632stderr
6Aug 29, 2026 10:015,71155,797,25646,392,0001,015,0002,117,632stderr
7Aug 29, 2026 10:015,71556,454,18046,415,0001,027,0002,117,632stderr
8Aug 29, 2026 10:015,72455,869,41546,482,0001,030,0002,117,632stderr
9Aug 29, 2026 10:015,72655,893,56146,393,0001,137,0002,117,632stderr