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 12:50wnwnScore: 3,572Success
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 12:503,41442,600,09927,243,0001,100,0002,482,176
2May 9, 2026 12:503,51946,307,47328,139,0001,076,0002,486,272
3May 9, 2026 12:503,53343,729,92728,258,0001,070,0002,486,272
4May 9, 2026 12:503,56747,041,45228,540,0001,067,0002,482,176
5May 9, 2026 12:503,57244,931,34428,604,0001,050,0002,482,176
6May 9, 2026 12:503,57942,885,43728,607,0001,099,0002,486,272
7May 9, 2026 12:503,58542,190,44728,678,0001,079,0002,486,272
8May 9, 2026 12:503,58948,968,58828,715,0001,081,0002,478,080
9May 9, 2026 12:503,59947,256,54728,790,0001,086,0002,486,272