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 26, 2026 23:26Victor MerckléVictor MerckléScore: 3,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:293,83540,264,59630,787,0001,046,0002,117,632stderr
2Aug 26, 2026 23:293,84440,257,63130,774,0001,132,0002,117,632stderr
3Aug 26, 2026 23:293,84440,267,98630,895,0001,018,0002,117,632stderr
4Aug 26, 2026 23:293,84540,374,26030,904,0001,013,0002,117,632stderr
5Aug 26, 2026 23:293,84840,352,39130,932,0001,010,0002,117,632stderr
6Aug 26, 2026 23:293,85240,200,71430,954,0001,020,0002,117,632stderr
7Aug 26, 2026 23:293,86140,376,20930,929,0001,119,0002,117,632stderr
8Aug 26, 2026 23:293,86840,542,96531,073,0001,032,0002,117,632stderr
9Aug 26, 2026 23:293,87740,564,45031,165,0001,022,0002,117,632stderr