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 listAug 31, 2025 21:10Adam FolwarcznyAdam FolwarcznyScore: 8,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2025 21:108,08196,771,88849,052,00018,019,0002,531,328
2Aug 31, 2025 21:108,08293,951,41646,056,00021,025,0002,281,472
3Aug 31, 2025 21:108,11791,337,81449,274,00018,100,0002,355,200
4Aug 31, 2025 21:108,13090,787,40049,350,00018,128,0002,367,488
5Aug 31, 2025 21:108,23692,904,74746,243,00022,116,0002,371,584
6Aug 31, 2025 21:108,26492,845,36451,695,00016,900,0002,277,376
7Aug 31, 2025 21:108,26589,740,37351,698,00016,901,0002,367,488
8Aug 31, 2025 21:108,26694,571,03155,685,00012,926,0002,359,296
9Aug 31, 2025 21:108,27392,729,49248,760,00019,902,0002,535,424
10Aug 31, 2025 21:108,28995,269,39652,844,00015,953,0002,355,200
11Aug 31, 2025 21:108,332101,121,28151,116,00018,040,0002,314,240
12Aug 31, 2025 21:108,33391,581,23455,128,00014,032,0002,273,280