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 26, 2026 13:21wnwnScore: 3,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:223,42644,484,69227,429,0001,015,0002,482,176
2Apr 26, 2026 13:223,43146,071,75627,467,0001,017,0002,486,272
3Apr 26, 2026 13:223,44548,985,21228,595,00002,478,080
4Apr 26, 2026 13:223,46040,642,28527,700,0001,025,0002,555,904
5Apr 26, 2026 13:223,47947,763,25326,887,0001,991,0002,482,176
6Apr 26, 2026 13:223,49440,864,36627,006,0002,000,0002,486,272
7Apr 26, 2026 13:223,49941,953,97128,048,0001,001,0002,490,368
8Apr 26, 2026 13:223,59746,219,54827,867,0001,990,0002,494,464
9Apr 26, 2026 13:223,66944,434,00529,439,0001,015,0002,490,368