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 listAug 6, 2025 00:49Leon ZhaoLeon ZhaoScore: 48,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2025 00:4948,184429,956,901398,928,000999,0002,383,872
2Aug 6, 2025 00:4948,185426,073,327397,935,0001,999,0002,379,776
3Aug 6, 2025 00:4948,186427,048,719396,946,0002,999,0002,265,088
4Aug 6, 2025 00:4948,199425,548,682398,054,0002,000,0002,510,848
5Aug 6, 2025 00:4948,220424,587,868399,225,0001,000,0002,519,040
6Aug 6, 2025 00:4948,223425,314,507399,247,0001,000,0002,519,040
7Aug 6, 2025 00:4948,233423,915,902399,337,0001,000,0002,510,848
8Aug 6, 2025 00:4948,235429,176,518398,349,0002,001,0002,387,968
9Aug 6, 2025 00:4948,294429,337,211398,842,0001,999,0002,510,848