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 listOct 15, 2024 20:24Elnur RakhmatullinElnur RakhmatullinScore: 50,449Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 20:2450,413444,801,335416,430,0002,002,0002,277,376
2Oct 15, 2024 20:2450,416452,220,696417,448,0001,001,0002,531,328
3Oct 15, 2024 20:2450,437449,034,094415,623,0003,004,0002,277,376
4Oct 15, 2024 20:2450,448443,151,605415,723,0002,998,0002,277,376
5Oct 15, 2024 20:2450,449450,940,876416,727,0001,998,0002,277,376
6Oct 15, 2024 20:2450,454446,671,752416,770,0001,998,0002,277,376
7Oct 15, 2024 20:2450,460449,646,966416,820,0001,999,0002,277,376
8Oct 15, 2024 20:2450,461443,883,668416,831,0001,999,0002,277,376
9Oct 15, 2024 20:2450,463449,154,239416,848,0001,999,0002,531,328