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 27, 2025 00:27Rohan KapurRohan KapurScore: 51,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2025 00:2751,543456,923,895426,810,000999,0002,289,664
2Jan 27, 2025 00:2751,544454,852,295425,816,0001,999,0002,289,664
3Jan 27, 2025 00:2751,563455,227,834426,971,000999,0002,289,664
4Jan 27, 2025 00:2751,564451,671,244426,983,000999,0002,289,664
5Jan 27, 2025 00:2751,567453,932,690426,008,0002,000,0002,371,584
6Jan 27, 2025 00:2751,571451,255,734427,043,0001,000,0002,289,664
7Jan 27, 2025 00:2751,573450,839,414426,058,0002,000,0002,367,488
8Jan 27, 2025 00:2751,595451,197,232428,235,00002,363,392
9Jan 27, 2025 00:2752,004459,791,736430,631,000999,0002,289,664