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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 23:493,72939,418,32229,768,0001,185,0002,117,632stderr
2Aug 12, 2026 23:493,76339,667,52930,102,0001,139,0002,117,632stderr
3Aug 12, 2026 23:493,76539,665,23730,114,0001,141,0002,117,632stderr
4Aug 12, 2026 23:493,79839,963,88630,441,0001,084,0002,117,632stderr
5Aug 12, 2026 23:493,81440,243,10830,640,0001,017,0002,117,632stderr
6Aug 12, 2026 23:493,82439,979,57830,640,0001,106,0002,117,632stderr
7Aug 12, 2026 23:493,82840,198,06230,628,0001,150,0002,117,632stderr
8Aug 12, 2026 23:493,86740,527,04031,007,0001,090,0002,117,632stderr
9Aug 12, 2026 23:493,98441,507,33031,989,0001,079,0002,117,632stderr