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 listMar 18, 2026 12:11Sriram SamiSriram SamiScore: 7,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 12:117,16180,937,32357,422,0002,014,0002,367,488
2Mar 18, 2026 12:117,17083,409,01556,486,0003,026,0002,478,080
3Mar 18, 2026 12:117,17990,385,74158,575,0001,009,0002,387,968
4Mar 18, 2026 12:117,20890,507,32656,839,0002,991,0002,404,352
5Mar 18, 2026 12:117,21591,268,91355,893,0003,992,0002,367,488
6Mar 18, 2026 12:117,24788,013,60558,146,0002,005,0002,490,368
7Mar 18, 2026 12:117,28082,804,30158,412,0002,014,0002,355,200
8Mar 18, 2026 12:117,28588,149,78758,449,0002,015,0002,355,200
9Mar 18, 2026 12:117,30991,097,13958,641,0002,022,0002,445,312