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 22:30Cyril SharmaCyril SharmaScore: 40,167Success
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 22:3039,962355,588,664266,749,00064,939,0002,473,984
2Jul 13, 2025 22:3039,984356,634,737273,889,00057,976,0002,285,568
3Jul 13, 2025 22:3040,086356,869,206284,756,00047,958,0002,285,568
4Jul 13, 2025 22:3040,132357,481,625277,078,00056,015,0002,473,984
5Jul 13, 2025 22:3040,167357,305,440281,324,00052,060,0002,469,888
6Jul 13, 2025 22:3040,173356,211,521283,374,00050,066,0002,469,888
7Jul 13, 2025 22:3040,208361,109,055286,765,00046,961,0002,277,376
8Jul 13, 2025 22:3040,222363,250,690272,871,00060,971,0002,285,568
9Jul 13, 2025 22:3040,306362,812,084264,426,00070,113,0002,310,144