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 7, 2025 20:21Yehor BondarYehor BondarScore: 147,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2025 20:21147,5061,251,147,8071,222,300,0001,998,0002,510,848
2Nov 7, 2025 20:21147,6431,252,992,0621,224,436,000999,0002,519,040
3Nov 7, 2025 20:21147,6801,251,173,0721,224,747,000999,0002,260,992
4Nov 7, 2025 20:21147,7021,250,865,4791,225,923,00002,260,992
5Nov 7, 2025 20:21147,7371,254,769,3481,224,219,0001,998,0002,260,992
6Nov 7, 2025 20:21148,4251,258,427,1801,231,924,00002,383,872
7Nov 7, 2025 20:21148,4901,262,912,8231,230,472,0001,999,0002,383,872
8Nov 7, 2025 20:21148,5221,254,628,1881,231,737,000999,0002,256,896
9Nov 7, 2025 20:21148,6971,261,223,7251,233,188,000999,0002,523,136