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 24, 2026 13:23Victor MerckléVictor MerckléScore: 8,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 13:238,13377,422,39766,370,0001,138,0002,113,536
2May 24, 2026 13:238,13579,592,06466,489,0001,038,0002,113,536
3May 24, 2026 13:238,13678,934,53466,367,0001,164,0002,113,536
4May 24, 2026 13:238,13776,825,97066,392,0001,153,0002,113,536
5May 24, 2026 13:238,13776,957,20966,383,0001,157,0002,113,536
6May 24, 2026 13:238,13876,907,27466,392,0001,161,0002,113,536
7May 24, 2026 13:238,13978,583,88366,532,0001,027,0002,113,536
8May 24, 2026 13:238,14077,443,13266,405,0001,163,0002,113,536
9May 24, 2026 13:238,14177,446,81566,556,0001,019,0002,113,536