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 26, 2025 17:37sheryllynn24sheryllynn24Score: 6,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 17:376,50481,090,51551,988,0001,999,0002,273,280
2Sep 26, 2025 17:376,50588,159,56751,991,0001,999,0002,285,568
3Sep 26, 2025 17:376,51480,432,11052,068,0002,002,0002,285,568
4Sep 26, 2025 17:376,64082,834,52953,112,0002,004,0002,519,040
5Sep 26, 2025 17:376,64383,527,59453,132,0002,005,0002,285,568
6Sep 26, 2025 17:376,67982,557,19554,430,0001,007,0002,285,568