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 listSep 27, 2025 18:16sheryllynn24sheryllynn24Score: 6,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 18:166,20976,631,56251,534,00002,285,568
2Sep 27, 2025 18:166,21280,239,34750,549,0001,010,0002,285,568
3Sep 27, 2025 18:166,22178,435,99350,620,0001,012,0002,285,568
4Sep 27, 2025 18:166,32976,612,65351,519,0001,010,0002,285,568
5Sep 27, 2025 18:166,33477,090,19651,559,0001,010,0002,285,568
6Sep 27, 2025 18:166,36583,981,95350,840,0001,993,0002,285,568