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 24, 2026 04:36wnwnScore: 3,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:373,58638,514,62027,977,0001,793,0002,113,536
2Sep 24, 2026 04:373,67939,271,16528,133,0002,409,00020,480
3Sep 24, 2026 04:373,72239,649,16428,591,0002,309,00020,480
4Sep 24, 2026 04:373,73139,679,39527,221,0003,754,00020,480
5Sep 24, 2026 04:373,77140,107,02929,223,0002,078,00020,480
6Sep 24, 2026 04:373,77340,114,33427,171,0004,153,0002,113,536
7Sep 24, 2026 04:373,84841,275,17528,481,0003,464,00020,480
8Sep 24, 2026 04:373,85241,372,09029,670,0002,307,00020,480
9Sep 24, 2026 04:373,95042,254,97928,628,0004,164,00020,480