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 listNov 4, 2025 04:12Tejas G.Tejas G.Score: 10,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 04:129,954114,480,02281,612,0001,007,0002,523,136
2Nov 4, 2025 04:129,968107,954,42781,736,000996,0002,289,664
3Nov 4, 2025 04:129,970108,508,92381,757,000997,0002,285,568
4Nov 4, 2025 04:129,972109,775,78981,773,000997,0002,285,568
5Nov 4, 2025 04:129,972113,297,00080,777,0001,994,0002,285,568
6Nov 4, 2025 04:1210,003110,400,10681,025,0002,000,0002,285,568
7Nov 4, 2025 04:1210,010106,324,96682,080,0001,000,0002,285,568
8Nov 4, 2025 04:1210,017109,656,59181,138,0002,003,0002,519,040
9Nov 4, 2025 04:1210,022105,603,16681,178,0002,004,0002,269,184
10Nov 4, 2025 04:1210,166111,134,08584,374,00002,285,568
11Nov 4, 2025 04:1210,222116,403,81083,841,000998,0002,285,568
12Nov 4, 2025 04:1210,238106,746,74482,980,0001,999,0002,514,944