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 7, 2026 10:08wnwnScore: 3,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:083,38445,362,76927,017,0001,071,0002,486,272
2May 7, 2026 10:083,39044,447,03827,066,0001,071,0002,486,272
3May 7, 2026 10:083,39243,106,93227,098,0001,058,0002,490,368
4May 7, 2026 10:083,39443,850,11227,125,0001,053,0002,490,368
5May 7, 2026 10:083,40145,049,81927,133,0001,098,0002,478,080
6May 7, 2026 10:083,41443,590,44327,243,0001,095,0002,486,272
7May 7, 2026 10:083,43142,635,16827,375,0001,108,0002,473,984
8May 7, 2026 10:083,43945,489,74727,456,0001,095,0002,478,080
9May 7, 2026 10:083,44745,545,54627,537,0001,074,0002,486,272