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 listJul 6, 2026 15:50Kevin HeaveyKevin HeaveyScore: 9,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 15:519,36387,240,27276,511,0001,208,0002,117,632
2Jul 6, 2026 15:519,36687,341,27076,517,0001,224,0002,117,632
3Jul 6, 2026 15:519,37287,313,19376,620,0001,174,0002,117,632
4Jul 6, 2026 15:519,38387,498,72376,639,0001,245,0002,117,632
5Jul 6, 2026 15:519,39287,535,12276,737,0001,220,0002,117,632
6Jul 6, 2026 15:519,46088,079,56377,314,0001,206,0002,117,632
7Jul 6, 2026 15:519,47588,103,09777,493,0001,152,0002,117,632
8Jul 6, 2026 15:519,59589,181,20878,410,0001,229,0002,117,632
9Jul 6, 2026 15:519,60289,247,02678,463,0001,234,0002,117,632