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 28, 2025 17:28etherealetherealScore: 128,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 17:28127,9841,092,220,4661,003,256,00059,015,0002,338,816
2Jan 28, 2025 17:28128,1261,089,720,8851,001,475,00061,967,0002,342,912
3Jan 28, 2025 17:28128,1881,090,625,1541,003,023,00060,940,0002,338,816
4Jan 28, 2025 17:28128,1941,093,250,2641,007,064,00056,947,0002,539,520
5Jan 28, 2025 17:28128,2161,092,060,0631,004,241,00059,954,0002,433,024
6Jan 28, 2025 17:28128,2591,093,388,8661,006,571,00057,975,0002,531,328
7Jan 28, 2025 17:28128,2761,087,112,1441,005,711,00058,983,0002,527,232
8Jan 28, 2025 17:28128,2921,093,153,0901,003,837,00060,990,0002,531,328
9Jan 28, 2025 17:28128,9641,101,685,8401,018,434,00051,971,0002,527,232