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 26, 2026 11:44Ayush SharmaAyush SharmaScore: 2,047,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 26, 2026 11:442,044,05716,998,274,86316,897,700,00067,970,0002,281,472
2Jan 26, 2026 11:442,044,33716,994,937,77516,894,025,00073,969,0002,281,472
3Jan 26, 2026 11:442,044,67417,003,902,79916,886,839,00083,959,0002,281,472
4Jan 26, 2026 11:442,045,24017,011,243,42216,900,529,00074,966,0002,281,472
5Jan 26, 2026 11:442,047,00017,020,951,93516,931,132,00058,972,0002,281,472
6Jan 26, 2026 11:442,047,05217,024,287,51116,903,576,00086,956,0002,293,760
7Jan 26, 2026 11:442,047,97317,032,863,01716,923,218,00074,961,0002,514,944
8Jan 26, 2026 11:442,065,75317,180,761,06517,074,783,00070,970,0002,289,664
9Jan 26, 2026 11:442,089,31617,373,400,65117,258,351,00082,968,0002,293,760