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 listDec 3, 2025 15:19Rajarshi BasuRajarshi BasuScore: 10,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 15:1910,222108,824,06382,844,0001,996,0002,486,272
2Dec 3, 2025 15:1910,239112,602,63283,981,000999,0002,498,560
3Dec 3, 2025 15:1910,244111,888,03383,022,0002,000,0002,289,664
4Dec 3, 2025 15:1910,246116,022,37884,041,0001,000,0002,281,472
5Dec 3, 2025 15:1910,246111,502,44383,040,0002,000,0002,289,664
6Dec 3, 2025 15:1910,249105,020,58483,067,0002,001,0002,494,464
7Dec 3, 2025 15:1910,344110,033,95283,857,0001,996,0002,281,472
8Dec 3, 2025 15:1910,355107,928,64583,945,0001,998,0002,289,664
9Dec 3, 2025 15:1910,371112,033,37584,076,0002,001,0002,289,664
10Dec 3, 2025 15:1910,454112,254,04284,777,0001,994,0002,502,656
11Dec 3, 2025 15:1910,459110,829,57485,798,0001,009,0002,490,368
12Dec 3, 2025 15:1910,464111,356,82684,853,0001,996,0002,289,664