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 19, 2025 21:29Adam FolwarcznyAdam FolwarcznyScore: 33,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2025 21:2933,734305,695,924277,994,0001,999,0002,260,992
2Aug 19, 2025 21:2933,757306,929,857279,183,0001,000,0002,260,992
3Aug 19, 2025 21:2933,759303,721,497279,196,0001,000,0002,392,064
4Aug 19, 2025 21:2933,765306,155,383279,250,0001,000,0002,379,776
5Aug 19, 2025 21:2933,766307,383,039279,258,0001,000,0002,523,136
6Aug 19, 2025 21:2933,777301,500,164279,347,0001,001,0002,519,040
7Aug 19, 2025 21:2933,789312,731,039279,448,0001,001,0002,392,064
8Aug 19, 2025 21:2933,801313,653,455279,551,0001,001,0002,383,872
9Aug 19, 2025 21:2933,847305,317,579278,927,0001,999,0002,383,872