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 5, 2026 22:56rubanrubanScore: 27,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 22:5627,202253,545,721223,779,0001,998,0002,289,664
2Feb 5, 2026 22:5627,217253,751,471223,900,0001,999,0002,289,664
3Feb 5, 2026 22:5627,219252,380,900224,917,000999,0002,289,664
4Feb 5, 2026 22:5627,224252,913,466223,959,0001,999,0002,289,664
5Feb 5, 2026 22:5627,685253,430,869228,783,000999,0002,473,984
6Feb 5, 2026 22:5627,702257,390,893228,931,000999,0002,367,488
7Feb 5, 2026 22:5627,956253,768,958231,037,0001,000,0002,289,664
8Feb 5, 2026 22:5627,969256,956,246231,145,0001,000,0002,355,200
9Feb 5, 2026 22:5627,996253,967,044232,364,00002,359,296