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 listApr 16, 2025 18:18Aleksey ShvetsAleksey ShvetsScore: 265,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2025 18:18264,9492,225,315,4232,104,115,00094,960,0002,469,888
2Apr 16, 2025 18:18264,9712,226,903,7912,113,326,00085,931,0002,326,528
3Apr 16, 2025 18:18264,9852,225,787,7322,115,436,00083,937,0002,322,432
4Apr 16, 2025 18:18265,0852,232,917,2552,113,235,00086,968,0002,469,888
5Apr 16, 2025 18:18265,1852,222,464,3742,121,072,00079,965,0002,473,984
6Apr 16, 2025 18:18265,2022,227,515,4622,103,261,00097,919,0002,326,528
7Apr 16, 2025 18:18265,2712,235,988,2232,097,808,000103,940,0002,322,432
8Apr 16, 2025 18:18265,6832,238,295,4822,094,261,000110,907,0002,322,432
9Apr 16, 2025 18:18266,3992,234,777,8372,121,145,00089,963,0002,326,528