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 listJan 29, 2025 12:01KeefeKeefeScore: 53,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 12:0152,805467,994,185437,280,0001,000,0002,273,280
2Jan 29, 2025 12:0152,820465,092,182437,406,0001,000,0002,281,472
3Jan 29, 2025 12:0153,782472,926,998445,390,0001,000,0002,269,184
4Jan 29, 2025 12:0153,785477,754,886444,416,0002,001,0002,289,664
5Jan 29, 2025 12:0153,786473,039,072445,425,0001,000,0002,281,472
6Jan 29, 2025 12:0153,788479,200,542445,439,0001,000,0002,277,376
7Jan 29, 2025 12:0153,790477,174,182444,459,0002,002,0002,281,472
8Jan 29, 2025 12:0153,810473,502,471443,622,0002,997,0002,277,376
9Jan 29, 2025 12:0153,811473,849,632444,632,0001,998,0002,277,376