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 listJun 28, 2026 09:24Victor MerckléVictor MerckléScore: 4,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:254,14442,076,73533,267,0001,129,0002,117,632stderr
2Jun 28, 2026 09:254,14543,466,80433,257,0001,152,0002,117,632stderr
3Jun 28, 2026 09:254,15542,364,84333,351,0001,138,0002,117,632stderr
4Jun 28, 2026 09:254,16542,319,36333,451,0001,123,0002,117,632stderr
5Jun 28, 2026 09:254,16642,300,87033,520,0001,062,0002,117,632stderr
6Jun 28, 2026 09:254,17042,388,18133,525,0001,089,0002,117,632stderr
7Jun 28, 2026 09:254,18342,473,64633,592,0001,133,0002,117,632stderr
8Jun 28, 2026 09:254,18442,400,69333,659,0001,072,0002,117,632stderr
9Jun 28, 2026 09:254,30543,512,88634,603,0001,136,0002,117,632stderr