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 listMar 30, 2025 07:23Emanuele BolognesiEmanuele BolognesiScore: 381,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2025 07:23380,5133,187,691,3703,088,294,00069,961,000184,320
2Mar 30, 2025 07:23380,5543,187,393,1313,082,636,00075,966,0002,281,472
3Mar 30, 2025 07:23380,7933,182,332,8633,096,611,00063,971,0002,453,504
4Mar 30, 2025 07:23380,8363,189,286,3613,093,963,00066,977,0002,281,472
5Mar 30, 2025 07:23381,0053,194,458,2613,112,369,00049,973,000192,512
6Mar 30, 2025 07:23381,5343,197,594,2963,097,782,00068,950,000192,512
7Mar 30, 2025 07:23382,0763,199,501,4733,109,262,00061,965,0002,281,472
8Mar 30, 2025 07:23382,0873,196,140,1303,107,357,00063,966,0002,281,472
9Mar 30, 2025 07:23392,6673,289,661,8663,197,171,00061,964,0002,289,664