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 22:16wnwnScore: 90,113Success
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 22:1690,060776,861,349745,497,0001,998,0002,498,560
2Feb 22, 2026 22:1690,084773,069,955745,697,0001,999,0002,486,272
3Feb 22, 2026 22:1690,111774,395,019746,924,000999,0002,277,376
4Feb 22, 2026 22:1690,113780,442,078746,938,000999,0002,277,376
5Feb 22, 2026 22:1690,281775,710,098746,337,0002,997,0002,273,280
6Feb 22, 2026 22:1690,311777,580,936747,585,0001,998,0002,277,376