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 listFeb 6, 2026 17:53Mikołaj UzarskiMikołaj UzarskiScore: 38,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 18:1938,093341,621,942315,168,0001,000,0002,514,944
2Feb 6, 2026 17:5338,094342,574,000314,177,0002,001,0002,523,136
3Feb 6, 2026 17:5338,095344,791,615315,192,0001,000,0002,527,232
4Feb 6, 2026 17:5338,096341,208,626315,199,0001,000,0002,531,328
5Feb 6, 2026 17:5338,105343,683,846316,274,00002,285,568
6Feb 6, 2026 18:1938,105338,771,955316,273,00002,527,232
7Feb 6, 2026 17:5338,106341,715,476315,277,0001,000,0002,285,568
8Feb 6, 2026 17:5338,109340,036,332315,303,0001,000,0002,285,568
9Feb 6, 2026 17:5338,114340,740,400315,349,0001,001,0002,285,568
10Feb 6, 2026 17:5338,116345,905,319315,362,0001,001,0002,527,232
11Feb 6, 2026 18:1938,117340,405,815315,373,0001,001,0002,285,568
12Feb 6, 2026 17:5338,129343,623,695316,473,00002,285,568