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 listMay 21, 2026 11:39Victor MerckléVictor MerckléScore: 4,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 11:404,68747,362,41837,803,0001,100,0002,113,536
2May 21, 2026 11:404,68946,752,02937,868,0001,055,0002,113,536
3May 21, 2026 11:404,69048,501,40837,850,0001,077,0002,113,536
4May 21, 2026 11:404,69948,478,31337,932,0001,071,0002,113,536
5May 21, 2026 11:404,70647,004,52038,056,0001,006,0002,113,536
6May 21, 2026 11:404,72348,884,85438,198,0001,006,0002,113,536
7May 21, 2026 11:404,72947,137,21238,250,0001,001,0002,113,536
8May 21, 2026 11:404,74750,106,74838,379,0001,023,0002,113,536
9May 21, 2026 11:404,79647,850,17438,725,0001,086,0002,113,536