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 listNov 11, 2025 17:22Dmytro IzotovDmytro IzotovScore: 73,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2025 17:2273,774638,935,811608,319,0004,002,0002,334,720
2Nov 11, 2025 17:2273,782638,536,282610,389,0001,998,0002,330,624
3Nov 11, 2025 17:2273,796645,151,646609,511,0002,997,0002,330,624
4Nov 11, 2025 17:2273,800639,026,895610,539,0001,998,0002,330,624
5Nov 11, 2025 17:2273,803638,434,814609,571,0002,997,0002,334,720
6Nov 11, 2025 17:2273,816641,535,220611,674,000999,0002,482,176
7Nov 11, 2025 17:2273,828640,079,886610,777,0001,999,0002,330,624
8Nov 11, 2025 17:2273,839641,113,418610,866,0001,999,0002,330,624
9Nov 11, 2025 17:2273,847636,666,443611,929,000999,0002,494,464