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 listDec 6, 2025 15:11Rajarshi BasuRajarshi BasuScore: 6,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:116,24378,993,36348,825,0002,989,0002,289,664
2Dec 6, 2025 15:116,24579,993,57649,804,0002,032,0002,281,472
3Dec 6, 2025 15:116,24677,696,80850,829,0001,016,0002,523,136
4Dec 6, 2025 15:116,37885,691,81450,944,0001,997,0002,289,664
5Dec 6, 2025 15:116,42082,276,99350,269,0003,016,0002,277,376
6Dec 6, 2025 15:116,42780,649,12250,326,0003,019,0002,289,664