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 listFeb 12, 2025 21:53Miguel Rodrigues Carrilho BorgesMiguel Rodrigues Carrilho BorgesScore: 61,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2025 21:5360,881529,372,996504,314,0001,000,0002,269,184
2Feb 12, 2025 21:5360,888528,322,796504,368,0001,000,0002,289,664
3Feb 12, 2025 21:5360,914535,371,629503,590,0001,998,0002,281,472
4Feb 12, 2025 21:5360,937532,958,405503,780,0001,999,0002,293,760
5Feb 12, 2025 21:5361,012531,942,685505,402,0001,000,0002,269,184
6Feb 12, 2025 21:5361,019538,080,149505,456,0001,000,0002,289,664
7Feb 12, 2025 21:5361,023536,383,662506,487,00002,269,184
8Feb 12, 2025 21:5361,037532,602,343506,606,00002,289,664
9Feb 12, 2025 21:5362,146537,814,230513,814,0001,999,0002,281,472