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 22, 2026 17:54Kasper KivimäkiKasper KivimäkiScore: 89,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 17:5488,903748,279,564679,430,00058,465,0002,113,536
2Jul 22, 2026 17:5488,957748,714,072679,863,00058,483,0002,113,536
3Jul 22, 2026 17:5488,974748,844,408680,022,00058,470,0002,113,536
4Jul 22, 2026 17:5489,000748,958,580679,758,00058,946,0002,113,536
5Jul 22, 2026 17:5489,003749,085,087680,019,00058,707,0002,113,536
6Jul 22, 2026 17:5489,063749,688,410680,063,00059,165,0002,113,536
7Jul 22, 2026 17:5489,066749,802,255679,880,00059,372,0002,113,536
8Jul 22, 2026 17:5489,099749,929,368680,085,00059,437,0002,113,536
9Jul 22, 2026 17:5489,173750,573,646680,444,00059,700,0002,113,536