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 listAug 26, 2025 08:59Ashish AhujaAshish AhujaScore: 11,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 08:5910,857121,434,52667,340,00022,776,0002,494,464
2Aug 26, 2025 08:5910,901115,365,48671,585,00018,890,0002,490,368
3Aug 26, 2025 08:5911,111119,288,60972,387,00019,832,0002,281,472
4Aug 26, 2025 08:5911,122118,704,00976,429,00015,881,0002,510,848
5Aug 26, 2025 08:5911,177126,376,37173,818,00018,953,0002,506,752
6Aug 26, 2025 08:5911,190120,601,94075,898,00016,977,0002,367,488