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 14, 2026 10:57Haha ExpertHaha ExpertScore: 47,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 11:0247,431413,660,255392,434,0001,250,0002,113,536
2Sep 14, 2026 11:0247,486403,367,813393,136,0001,005,0002,113,536
3Sep 14, 2026 11:0247,493402,695,926393,197,0001,003,0002,113,536
4Sep 14, 2026 11:0247,496402,551,885393,220,0001,004,0002,113,536
5Sep 14, 2026 11:0247,501402,820,246393,257,0001,004,0002,113,536
6Sep 14, 2026 11:0247,514402,720,905393,369,0001,004,0002,113,536
7Sep 14, 2026 11:0247,518402,959,566393,404,0001,003,0002,113,536
8Sep 14, 2026 11:0247,544403,215,115393,619,0001,004,0002,113,536
9Sep 14, 2026 11:0247,563403,316,380393,774,0001,003,0002,113,536