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 listAug 9, 2025 00:36Leon ZhaoLeon ZhaoScore: 16,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2025 00:3616,793167,728,875139,384,00002,469,888
2Aug 9, 2025 00:3616,794163,200,948138,388,0001,002,0002,285,568
3Aug 9, 2025 00:3616,801168,209,795138,446,0001,003,0002,285,568