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 listJan 8, 2026 12:49Pavel SkripkinPavel SkripkinScore: 41,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 12:4940,814363,571,345336,761,0001,998,0002,359,296
2Jan 8, 2026 12:4940,831363,730,121337,899,000999,0002,281,472
3Jan 8, 2026 12:4940,845369,707,538337,015,0002,000,0002,281,472
4Jan 8, 2026 12:4941,453372,673,562343,060,0001,000,0002,281,472
5Jan 8, 2026 12:4941,490371,883,665343,364,0001,001,0002,351,104
6Jan 8, 2026 12:4941,541369,740,101342,793,0001,998,0002,281,472
7Jan 8, 2026 12:4941,549373,067,929342,857,0001,999,0002,281,472
8Jan 8, 2026 12:4941,570376,611,411343,034,0002,000,0002,281,472
9Jan 8, 2026 12:4970,423615,889,755582,510,0001,998,0002,281,472