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 listFeb 22, 2026 20:12wnwnScore: 4,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 20:124,44060,622,23634,863,0001,992,0002,535,424
2Feb 22, 2026 20:124,44258,255,58535,845,0001,024,0002,486,272
3Feb 22, 2026 20:124,44756,529,03234,916,0001,995,0002,494,464
4Feb 22, 2026 20:124,46862,843,22635,080,0002,004,0002,277,376
5Feb 22, 2026 20:124,47059,087,61935,100,0002,005,0002,277,376
6Feb 22, 2026 20:124,53766,032,42136,636,0001,017,0002,486,272
7Feb 22, 2026 20:124,55762,075,81336,831,000995,0002,531,328
8Feb 22, 2026 20:124,56060,846,50735,856,0001,992,0002,277,376
9Feb 22, 2026 20:124,57767,435,74035,987,0001,999,0002,494,464