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 9, 2026 14:03wnwnScore: 3,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 14:043,36242,922,60226,859,0001,052,0002,490,368
2May 9, 2026 14:043,38640,941,44027,076,0001,034,0002,494,464
3May 9, 2026 14:043,43541,373,62427,448,0001,063,0002,478,080
4May 9, 2026 14:043,44542,252,17727,554,0001,044,0002,482,176
5May 9, 2026 14:043,53946,444,82228,310,0001,066,0002,490,368
6May 9, 2026 14:043,54245,073,25028,344,0001,061,0002,478,080
7May 9, 2026 14:043,55548,159,10528,443,0001,071,0002,494,464
8May 9, 2026 14:043,55845,044,13028,400,0001,134,0002,490,368
9May 9, 2026 14:043,56548,466,65928,498,0001,098,0002,482,176