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 listFeb 16, 2026 20:51wnwnScore: 8,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 20:517,50186,635,96357,240,0005,021,0002,514,944
2Feb 16, 2026 20:517,57989,087,45059,907,0002,995,0002,285,568
3Feb 16, 2026 20:517,59787,193,71860,055,0003,002,0002,494,464
4Feb 16, 2026 20:518,72593,338,90768,394,0004,023,0002,387,968
5Feb 16, 2026 20:518,75998,505,30568,716,0003,983,0002,359,296
6Feb 16, 2026 20:519,03699,192,93472,002,0003,000,0002,433,024