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 listJan 29, 2026 20:36sandheep rajkumarsandheep rajkumarScore: 80,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2026 20:3680,079692,830,521619,678,00044,976,0002,301,952
2Jan 29, 2026 20:3680,185696,225,579618,566,00046,967,0002,293,760
3Jan 29, 2026 20:3680,300700,025,573635,471,00031,023,0002,289,664
4Jan 29, 2026 20:3680,421691,324,642629,520,00037,971,0002,281,472
5Jan 29, 2026 20:3680,440689,125,647600,691,00066,965,0002,289,664
6Jan 29, 2026 20:3680,444697,128,357578,730,00088,958,0002,289,664
7Jan 29, 2026 20:3680,451693,949,601604,765,00062,975,0002,289,664
8Jan 29, 2026 20:3680,487688,826,711624,039,00044,002,0002,289,664
9Jan 29, 2026 20:3680,491694,797,165593,068,00075,008,0002,297,856