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 27, 2026 07:51wnwnScore: 3,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 07:523,40642,311,29027,264,0001,009,0002,486,272
2Apr 27, 2026 07:523,42742,880,49127,433,0001,016,0002,478,080
3Apr 27, 2026 07:523,44346,529,96527,565,0001,020,0002,490,368
4Apr 27, 2026 07:523,47346,970,53226,846,0001,988,0002,494,464
5Apr 27, 2026 07:523,47742,978,56427,835,0001,030,0002,490,368
6Apr 27, 2026 07:523,49146,402,58926,982,0001,998,0002,482,176
7Apr 27, 2026 07:523,58548,760,12327,774,0001,983,0002,486,272
8Apr 27, 2026 07:523,59243,838,60627,831,0001,987,0002,490,368
9Apr 27, 2026 07:523,60949,708,16827,958,0001,997,0002,486,272