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 02:01Victor MerckléVictor MerckléScore: 4,832Success
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 02:024,82248,410,73038,971,0001,057,0002,117,632stderr
2Aug 29, 2026 02:024,82348,396,48638,883,0001,150,0002,117,632stderr
3Aug 29, 2026 02:024,82549,018,39938,922,0001,131,0002,117,632stderr
4Aug 29, 2026 02:024,82749,021,30438,931,0001,135,0002,117,632stderr
5Aug 29, 2026 02:024,83250,396,53938,968,0001,140,0002,117,632stderr
6Aug 29, 2026 02:024,83549,751,75238,979,0001,152,0002,117,632stderr
7Aug 29, 2026 02:024,85448,701,97539,235,0001,054,0002,117,632stderr
8Aug 29, 2026 02:025,10350,740,59441,306,0001,053,0002,117,632stderr
9Aug 29, 2026 02:025,10450,738,74541,319,0001,047,0002,117,632stderr