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 12, 2026 11:56Victor MerckléVictor MerckléScore: 10,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 11:5610,08694,069,10682,629,0001,086,0002,113,536
2May 12, 2026 11:5610,09092,989,17982,649,0001,100,0002,113,536
3May 12, 2026 11:5610,09093,301,16282,653,0001,100,0002,113,536
4May 12, 2026 11:5610,10092,911,43082,644,0001,186,0002,113,536
5May 12, 2026 11:5610,10193,956,17582,675,0001,166,0002,113,536
6May 12, 2026 11:5610,10293,080,50282,678,0001,173,0002,113,536
7May 12, 2026 11:5610,10393,299,31982,675,0001,184,0002,113,536
8May 12, 2026 11:5610,11092,595,56582,917,0001,003,0002,113,536
9May 12, 2026 11:5610,52398,960,45683,131,0004,213,0002,113,536