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 7, 2026 19:06Kevin HeaveyKevin HeaveyScore: 10,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 19:0710,27094,815,75084,131,0001,113,0002,117,632
2Jul 7, 2026 19:0710,28094,876,38084,213,0001,112,0002,117,632
3Jul 7, 2026 19:0710,28394,915,58184,207,0001,146,0002,117,632
4Jul 7, 2026 19:0710,28595,018,32484,260,0001,107,0002,117,632
5Jul 7, 2026 19:0710,29394,958,83784,222,0001,211,0002,117,632
6Jul 7, 2026 19:0710,29895,029,69784,362,0001,116,0002,117,632
7Jul 7, 2026 19:0710,31095,152,93584,461,0001,115,0002,117,632
8Jul 7, 2026 19:0710,45997,742,32685,706,0001,107,0002,117,632
9Jul 7, 2026 19:0710,46496,518,57085,710,0001,143,0002,117,632