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 11, 2026 16:12Victor MerckléVictor MerckléScore: 10,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:1310,23293,828,16583,821,0001,111,0002,113,536
2May 11, 2026 16:1310,23494,268,77683,820,0001,126,0002,113,536
3May 11, 2026 16:1310,24593,816,21684,038,0001,003,0002,113,536
4May 11, 2026 16:1310,24594,393,63484,030,0001,004,0002,113,536
5May 11, 2026 16:1310,24593,810,42883,868,0001,170,0002,113,536
6May 11, 2026 16:1310,24695,245,63483,860,0001,183,0002,113,536
7May 11, 2026 16:1310,24894,933,86983,869,0001,190,0002,113,536
8May 11, 2026 16:1310,25796,050,91484,066,0001,069,0002,113,536
9May 11, 2026 16:1310,26394,344,68084,062,0001,126,0002,113,536