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 listApr 6, 2026 15:01Danylo MocherniukDanylo MocherniukScore: 6,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 15:016,73178,229,54752,873,0002,992,0002,269,184
2Apr 6, 2026 15:026,74182,727,19254,954,000999,0002,297,856
3Apr 6, 2026 15:026,74278,834,02654,956,000999,0002,297,856
4Apr 6, 2026 15:016,75777,240,43353,081,0003,004,0002,531,328
5Apr 6, 2026 15:026,77986,295,11254,259,0002,009,0002,297,856
6Apr 6, 2026 15:016,95786,486,52855,718,0002,026,0002,289,664