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 25, 2025 07:41Ruoyu QiuRuoyu QiuScore: 54,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 07:4154,698479,131,987451,992,0001,999,0002,273,280
2Aug 25, 2025 07:4154,700474,220,142452,007,0002,000,0002,531,328
3Aug 25, 2025 07:4154,711476,692,753453,099,0001,000,0002,273,280
4Aug 25, 2025 07:4154,716476,873,745452,143,0002,000,0002,265,088
5Aug 25, 2025 07:4154,718484,973,192452,159,0002,000,0002,273,280
6Aug 25, 2025 07:4154,720478,605,225454,180,00002,379,776
7Aug 25, 2025 07:4154,726477,102,557451,225,0003,001,0002,273,280
8Aug 25, 2025 07:4154,735476,850,523453,301,0001,000,0002,273,280
9Aug 25, 2025 07:4154,748483,122,037451,410,0003,002,0002,273,280