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 23, 2026 17:59wnwnScore: 4,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 18:024,39955,898,96735,496,0001,014,0002,273,280
2Feb 23, 2026 18:024,41059,762,22135,589,0001,016,0002,273,280
3Feb 23, 2026 17:594,42263,501,39835,682,0001,019,0002,490,368
4Feb 23, 2026 17:594,43770,132,08535,836,000995,0002,490,368
5Feb 23, 2026 18:024,43759,926,86135,830,000995,0002,531,328
6Feb 23, 2026 17:598,68594,759,54770,086,0002,002,0002,535,424