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 00:55Andrew EpsteinAndrew EpsteinScore: 151,891Success
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 00:56151,5251,267,967,1941,255,646,0002,015,0002,117,632stderr
2Sep 17, 2026 00:56151,5511,268,363,4331,255,849,0002,029,0002,117,632stderr
3Sep 17, 2026 00:56151,7281,270,300,3861,257,342,0002,007,0002,117,632stderr
4Sep 17, 2026 00:56151,7431,269,723,7341,257,455,0002,012,0002,117,632stderr
5Sep 17, 2026 00:56151,8911,271,304,7811,258,509,0002,194,0002,117,632stderr
6Sep 17, 2026 00:56151,9681,271,622,3981,259,140,0002,200,0002,117,632stderr
7Sep 17, 2026 00:56152,0601,272,597,0051,260,094,0002,008,0002,117,632stderr
8Sep 17, 2026 00:56152,1011,272,957,6041,260,428,0002,017,0002,117,632stderr
9Sep 17, 2026 00:56152,2241,273,591,4501,261,148,0002,315,0002,117,632stderr