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 27, 2024 01:21Jarry XiaoJarry XiaoScore: 91,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2024 01:2191,156783,154,408702,624,00053,971,0002,285,568
2Oct 27, 2024 01:2191,253783,525,245706,438,00050,959,0002,400,256
3Oct 27, 2024 01:2191,269785,545,828707,562,00049,969,0002,293,760
4Oct 27, 2024 01:2191,270782,591,588714,570,00042,974,0002,310,144
5Oct 27, 2024 01:2191,284785,900,137699,686,00057,974,0002,293,760
6Oct 27, 2024 01:2191,289783,209,110702,718,00054,977,0002,293,760
7Oct 27, 2024 01:2191,313784,810,701712,904,00044,993,0002,306,048
8Oct 27, 2024 01:2191,326780,464,346709,007,00049,000,0002,314,240
9Oct 27, 2024 01:2191,354788,145,514704,219,00054,016,0002,310,144