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 listFeb 15, 2025 10:15Roman LytkinRoman LytkinScore: 264,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2025 10:15263,9802,221,024,4082,097,072,00093,958,0002,322,432
2Feb 15, 2025 10:15264,0782,214,536,9382,091,903,00099,947,0002,326,528
3Feb 15, 2025 10:15264,2042,223,085,2312,101,943,00090,954,0002,322,432
4Feb 15, 2025 10:15264,2772,219,484,0302,087,569,000105,927,0002,322,432
5Feb 15, 2025 10:15264,3052,221,944,4992,108,784,00084,951,0002,473,984
6Feb 15, 2025 10:15264,3162,219,190,2762,096,832,00096,992,0002,326,528
7Feb 15, 2025 10:15264,3382,214,282,1852,090,056,000103,953,0002,326,528
8Feb 15, 2025 10:15264,4102,223,929,6142,086,671,000107,931,0002,482,176
9Feb 15, 2025 10:15264,6202,223,116,9712,096,376,00099,970,0002,322,432