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 3, 2025 15:31Rohan KapurRohan KapurScore: 60,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2025 15:3160,277524,133,977499,297,0001,000,0002,281,472
2Jan 3, 2025 15:3160,312533,315,257498,593,0001,998,0002,281,472
3Jan 3, 2025 15:3160,316531,810,184499,626,000999,0002,289,664
4Jan 3, 2025 15:3160,317527,642,669499,630,000999,0002,289,664
5Jan 3, 2025 15:3160,317529,018,503498,636,0001,998,0002,289,664
6Jan 3, 2025 15:3160,317531,802,272498,635,0001,998,0002,289,664
7Jan 3, 2025 15:3160,327535,053,472499,713,000999,0002,289,664
8Jan 3, 2025 15:3160,328527,247,630498,725,0001,998,0002,363,392
9Jan 3, 2025 15:3160,333524,099,891499,762,000999,0002,289,664