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 listApr 18, 2026 04:04wnwnScore: 6,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 04:006,25077,425,59550,879,000997,0002,494,464
2Apr 18, 2026 04:046,25776,660,01349,940,0001,997,0002,482,176
3Apr 18, 2026 04:006,26877,570,76050,025,0002,001,0002,482,176
4Apr 18, 2026 04:046,27272,544,05750,058,0002,002,0002,486,272
5Apr 18, 2026 04:046,27673,455,38550,088,0002,003,0002,277,376
6Apr 18, 2026 04:006,37776,953,33850,931,0001,997,0002,277,376