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 listJan 6, 2025 22:56woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 287,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2025 22:56286,1612,404,231,0292,374,140,000999,0002,289,664
2Jan 6, 2025 22:56286,8752,403,745,1192,381,062,00002,289,664
3Jan 6, 2025 22:56286,9142,417,580,6132,379,385,0001,998,0002,281,472
4Jan 6, 2025 22:56286,9482,405,473,5272,380,668,000999,0002,269,184
5Jan 6, 2025 22:56287,0772,405,969,5082,380,737,0001,998,0002,281,472
6Jan 6, 2025 22:56287,0812,403,614,1612,380,772,0001,998,0002,281,472
7Jan 6, 2025 22:56287,3072,411,448,6852,383,646,000999,0002,289,664
8Jan 6, 2025 22:56287,4702,410,978,2442,384,003,0001,999,0002,265,088
9Jan 6, 2025 22:56287,9952,416,797,2342,389,356,000999,0002,273,280