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 listMay 24, 2026 15:38Victor MerckléVictor MerckléScore: 10,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 15:3910,24192,837,65883,947,0001,061,0002,113,536
2May 24, 2026 15:3910,24593,726,48983,972,0001,067,0002,113,536
3May 24, 2026 15:3910,25294,369,95884,021,0001,071,0002,113,536
4May 24, 2026 15:3910,25493,932,97784,041,0001,074,0002,113,536
5May 24, 2026 15:3910,26393,004,86584,134,0001,052,0002,113,536
6May 24, 2026 15:3910,26893,813,29884,156,0001,074,0002,113,536
7May 24, 2026 15:3910,26896,211,40784,177,0001,051,0002,113,536
8May 24, 2026 15:3910,29394,398,26184,402,0001,037,0002,113,536
9May 24, 2026 15:3910,47694,979,02385,932,0001,026,0002,113,536