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 listSep 17, 2026 13:50Andrew EpsteinAndrew EpsteinScore: 16,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 14:0016,169142,996,299133,149,0001,056,0002,117,632stderr
2Sep 17, 2026 14:0016,223148,947,498133,532,0001,126,0002,117,632stderr
3Sep 17, 2026 14:0016,267143,748,386133,928,0001,089,0002,117,632stderr
4Sep 17, 2026 14:0016,278144,453,844134,047,0001,067,0002,117,632stderr
5Sep 17, 2026 14:0016,279145,279,352134,033,0001,089,0002,117,632stderr
6Sep 17, 2026 14:0016,300144,223,007134,217,0001,075,0002,117,632stderr
7Sep 17, 2026 14:0016,304144,739,103134,250,0001,077,0002,117,632stderr
8Sep 17, 2026 14:0016,370145,182,144134,804,0001,072,0002,117,632stderr
9Sep 17, 2026 14:0016,387144,776,449134,935,0001,079,0002,117,632stderr