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:26Rajarshi BasuRajarshi BasuScore: 10,576Success
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:2610,336109,855,35383,796,0001,995,0002,289,664
2Dec 3, 2025 15:2610,345106,535,09684,866,000998,0002,490,368
3Dec 3, 2025 15:2610,349106,622,00684,896,000998,0002,289,664
4Dec 3, 2025 15:2610,576110,076,36085,787,0001,995,0002,494,464
5Dec 3, 2025 15:2610,579117,518,89385,812,0001,995,0002,289,664
6Dec 3, 2025 15:2610,700115,239,84286,812,0001,995,0002,498,560