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 24, 2026 21:17Victor MerckléVictor MerckléScore: 3,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 21:183,79039,891,96130,234,0001,223,0002,117,632stderr
2Aug 24, 2026 21:183,79439,885,77530,310,0001,184,0002,117,632stderr
3Aug 24, 2026 21:183,79639,912,95030,263,0001,247,0002,117,632stderr
4Aug 24, 2026 21:183,79741,645,34130,320,0001,199,0002,117,632stderr
5Aug 24, 2026 21:183,79839,928,34130,394,0001,134,0002,117,632stderr
6Aug 24, 2026 21:183,82340,154,00530,598,0001,138,0002,117,632stderr
7Aug 24, 2026 21:183,82840,115,55630,627,0001,149,0002,117,632stderr
8Aug 24, 2026 21:183,83540,285,28130,679,0001,159,0002,117,632stderr
9Aug 24, 2026 21:183,83940,246,63130,665,0001,206,0002,117,632stderr