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 listJul 24, 2025 17:45Leon ZhaoLeon ZhaoScore: 66,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2025 17:4566,718581,697,572551,763,0001,999,0002,519,040
2Jul 24, 2025 17:4566,723580,592,972552,803,000999,0002,256,896
3Jul 24, 2025 17:4566,730585,664,084552,862,000999,0002,260,992
4Jul 24, 2025 17:4566,733580,479,996552,886,000999,0002,260,992
5Jul 24, 2025 17:4566,733584,709,122552,887,000999,0002,260,992
6Jul 24, 2025 17:4566,733580,004,379551,881,0001,999,0002,383,872
7Jul 24, 2025 17:4566,735578,905,798551,898,0001,999,0002,260,992
8Jul 24, 2025 17:4566,739584,433,680552,932,000999,0002,519,040
9Jul 24, 2025 17:4566,764581,679,900553,145,0001,000,0002,256,896