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 listJul 13, 2025 14:02Cyril SharmaCyril SharmaScore: 89,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2025 14:0289,569765,785,115687,464,00055,956,0002,285,568
2Jul 13, 2025 14:0289,871768,488,697686,933,00058,994,0002,277,376
3Jul 13, 2025 14:0289,905770,695,051687,195,00059,016,0002,285,568
4Jul 13, 2025 14:0289,913772,705,720700,264,00046,017,0002,285,568
5Jul 13, 2025 14:0289,965771,074,301704,723,00041,983,0002,469,888
6Jul 13, 2025 14:0290,056775,210,212686,509,00060,956,0002,289,664
7Jul 13, 2025 14:0290,094777,839,220687,795,00059,982,0002,285,568
8Jul 13, 2025 14:0290,135774,373,363680,108,00068,010,0002,285,568
9Jul 13, 2025 14:0290,135770,210,286697,114,00051,008,0002,277,376