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 listJun 8, 2025 19:59Hayk KarapetyanHayk KarapetyanScore: 459,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2025 19:59458,9633,834,532,8963,745,422,00063,973,0002,281,472
2Jun 8, 2025 19:59458,9773,839,447,7853,725,561,00083,945,0002,289,664
3Jun 8, 2025 19:59459,0373,834,539,1993,726,047,00083,956,0002,379,776
4Jun 8, 2025 19:59459,0723,839,263,4433,731,334,00078,964,0002,281,472
5Jun 8, 2025 19:59459,5353,839,318,5063,753,169,00060,970,0002,289,664
6Jun 8, 2025 19:59460,6473,854,883,5263,757,416,00065,954,0002,289,664
7Jun 8, 2025 19:59460,7443,849,017,4143,749,212,00074,964,0002,281,472
8Jun 8, 2025 19:59464,9523,884,133,0023,785,142,00073,963,0002,289,664
9Jun 8, 2025 19:59475,9513,984,597,1573,868,447,00081,945,0002,506,752