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 23, 2025 08:41Tan Lip WeiTan Lip WeiScore: 45,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 08:4145,733409,191,218379,586,00002,285,568
2Oct 23, 2025 08:4145,735411,740,440377,603,0001,997,0002,285,568
3Oct 23, 2025 08:4145,743408,259,076377,667,0001,998,0002,285,568
4Oct 23, 2025 08:4145,745404,647,224378,684,0001,001,0002,392,064
5Oct 23, 2025 08:4145,748405,969,958377,709,0001,998,0002,285,568
6Oct 23, 2025 08:4145,750401,835,108377,724,0001,998,0002,285,568
7Oct 23, 2025 08:4145,753403,921,536378,754,000999,0002,285,568
8Oct 23, 2025 08:4145,760403,340,516377,808,0001,998,0002,285,568
9Oct 23, 2025 08:4145,771402,041,698377,903,0001,999,0002,367,488