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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:303,72839,311,55829,828,0001,122,0002,117,632stderr
2Aug 23, 2026 19:303,74440,756,92629,967,0001,110,0002,117,632stderr
3Aug 23, 2026 19:303,74640,167,25729,959,0001,134,0002,117,632stderr
4Aug 23, 2026 19:303,75140,122,36930,025,0001,113,0002,117,632stderr
5Aug 23, 2026 19:303,76439,678,26930,145,0001,103,0002,117,632stderr
6Aug 23, 2026 19:303,76439,602,64930,228,0001,019,0002,117,632stderr
7Aug 23, 2026 19:303,76840,297,67530,156,0001,125,0002,117,632stderr
8Aug 23, 2026 19:303,77839,720,42130,290,0001,074,0002,117,632stderr
9Aug 23, 2026 19:303,79639,912,28630,421,0001,088,0002,117,632stderr