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 18, 2025 05:17Ashish AhujaAshish AhujaScore: 12,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 05:1711,933126,025,56595,043,0004,001,0002,334,720
2Aug 18, 2025 05:1711,993124,880,71089,585,0009,953,0002,457,600
3Aug 18, 2025 05:1712,110129,684,05691,553,0008,956,0002,310,144
4Aug 18, 2025 05:1712,188124,650,87094,147,0007,010,0002,510,848
5Aug 18, 2025 05:1712,200127,860,54895,242,0006,015,0002,506,752
6Aug 18, 2025 05:1712,251129,444,65093,711,0007,975,0002,334,720
7Aug 18, 2025 05:1712,331128,742,22893,320,0009,031,0002,342,912
8Aug 18, 2025 05:1712,727133,582,00496,667,0008,969,0002,334,720
9Aug 18, 2025 05:1712,765129,239,99996,953,0008,995,0002,342,912