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 listMar 15, 2026 16:04shartgepettoshartgepettoScore: 10,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 16:0410,134105,429,42579,107,0005,006,0002,469,888
2Mar 15, 2026 16:0410,137107,594,56780,134,0004,006,0002,453,504
3Mar 15, 2026 16:0410,311112,936,13781,553,0004,027,0002,465,792
4Mar 15, 2026 16:0410,374108,516,12282,100,0004,004,0002,306,048
5Mar 15, 2026 16:0410,450121,653,27980,755,0005,981,0002,363,392
6Mar 15, 2026 16:0410,460115,183,24181,825,0004,989,0002,473,984
7Mar 15, 2026 16:0410,461112,933,04982,837,0003,992,0002,490,368
8Mar 15, 2026 16:0410,470110,478,57381,904,0004,994,0002,498,560
9Mar 15, 2026 16:0410,628109,937,84884,207,0004,009,0002,494,464