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 29, 2025 09:18Adam FolwarcznyAdam FolwarcznyScore: 10,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2025 09:1810,508113,895,85747,039,00040,179,0002,527,232
2Aug 29, 2025 09:1810,567116,111,91348,288,00039,419,0002,437,120
3Aug 29, 2025 09:1810,631114,427,74150,002,00038,237,0002,453,504
4Aug 29, 2025 09:1810,640118,404,52149,064,00039,251,0002,289,664
5Aug 29, 2025 09:1810,674115,552,21253,159,00035,439,0002,523,136
6Aug 29, 2025 09:1810,687117,629,67749,281,00039,425,0002,523,136
7Aug 29, 2025 09:1810,704116,070,84748,370,00040,473,0002,453,504
8Aug 29, 2025 09:1810,715116,797,64852,374,00036,563,0002,428,928
9Aug 29, 2025 09:1810,729115,415,60652,443,00036,611,0002,510,848
10Aug 29, 2025 09:1810,803113,368,06855,177,00034,485,0002,494,464
11Aug 29, 2025 09:1810,814120,120,09852,274,00037,480,0002,437,120
12Aug 29, 2025 09:1810,933118,042,99749,319,00041,428,0002,437,120