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 23, 2026 16:08Kasper KivimäkiKasper KivimäkiScore: 57,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 16:0857,116483,774,421472,988,0001,079,0002,113,536
2Jul 23, 2026 16:0857,122484,447,598473,011,0001,109,0002,113,536
3Jul 23, 2026 16:0857,640488,755,573477,246,0001,170,0002,113,536
4Jul 23, 2026 16:0857,768489,340,493478,321,0001,160,0002,113,536
5Jul 23, 2026 16:0857,783489,431,158478,447,0001,157,0002,113,536
6Jul 23, 2026 16:0857,950490,782,371479,877,0001,109,0002,113,536
7Jul 23, 2026 16:0858,333494,573,300483,093,0001,077,0002,113,536
8Jul 23, 2026 16:0858,380494,260,822483,478,0001,081,0002,113,536
9Jul 23, 2026 16:0858,513495,969,109484,513,0001,145,0002,113,536