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 listAug 27, 2026 10:41Victor MerckléVictor MerckléScore: 23,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 10:4223,784205,662,485196,384,0001,030,0002,113,536
2Aug 27, 2026 10:4223,792205,751,260196,448,0001,032,0002,113,536
3Aug 27, 2026 10:4223,798205,889,077196,492,0001,038,0002,113,536
4Aug 27, 2026 10:4223,801205,916,304196,485,0001,066,0002,113,536
5Aug 27, 2026 10:4223,805206,561,004196,527,0001,060,0002,113,536
6Aug 27, 2026 10:4223,809206,711,094196,490,0001,125,0002,113,536
7Aug 27, 2026 10:4223,923206,879,075197,512,0001,056,0002,113,536
8Aug 27, 2026 10:4224,017207,753,145198,312,0001,033,0002,113,536
9Aug 27, 2026 10:4224,555212,928,155202,756,0001,057,0002,113,536