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 07:20Victor MerckléVictor MerckléScore: 4,153Success
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 07:214,13542,415,87533,287,0001,041,0002,117,632stderr
2Jul 6, 2026 07:214,13642,305,37033,301,0001,029,0002,117,632stderr
3Jul 6, 2026 07:214,14042,332,27033,327,0001,042,0002,117,632stderr
4Jul 6, 2026 07:214,14242,362,35733,366,0001,013,0002,117,632stderr
5Jul 6, 2026 07:214,15342,484,78433,336,0001,138,0002,117,632stderr
6Jul 6, 2026 07:214,15942,517,76333,418,0001,102,0002,117,632stderr
7Jul 6, 2026 07:214,17342,413,59033,513,0001,130,0002,117,632stderr
8Jul 6, 2026 07:214,19142,618,52333,728,0001,065,0002,117,632stderr
9Jul 6, 2026 07:214,20642,889,20133,890,0001,024,0002,117,632stderr