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 16:53Abilmansur YeshmuratovAbilmansur YeshmuratovScore: 355,102Success
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 16:53354,0292,970,158,9152,857,487,00080,957,0002,310,144
2Oct 15, 2024 16:53354,1392,967,411,4822,868,393,00070,960,0002,285,568
3Oct 15, 2024 16:53355,0292,977,713,1592,874,775,00071,969,0002,285,568
4Oct 15, 2024 16:53355,0562,970,600,9912,878,988,00067,976,0002,285,568
5Oct 15, 2024 16:53355,1022,979,051,6282,865,394,00081,954,0002,285,568
6Oct 15, 2024 16:53355,1982,975,707,6672,863,172,00084,975,0002,293,760
7Oct 15, 2024 16:53355,3362,976,838,3842,874,334,00074,956,0002,379,776
8Oct 15, 2024 16:53355,6712,981,690,4482,871,125,00080,947,0002,285,568
9Oct 15, 2024 16:53358,4763,002,155,9702,899,394,00075,957,0002,445,312