Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listJul 14, 2025 22:09Valentin KofmanValentin KofmanScore: 120,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2025 22:09120,539613,689,915589,641,000999,0002,273,280
2Jul 14, 2025 22:09120,546617,747,764588,675,0001,998,0002,273,280
3Jul 14, 2025 22:09120,555612,489,150588,721,0001,999,0002,392,064
4Jul 14, 2025 22:09120,558621,284,578589,737,000999,0002,396,160
5Jul 14, 2025 22:09120,653614,954,490591,201,00002,404,352
6Jul 14, 2025 22:09120,700618,526,721589,433,0001,998,0002,400,256
7Jul 14, 2025 22:09120,865617,330,686592,239,00002,273,280
8Jul 14, 2025 22:09121,332622,776,040593,528,000999,0002,273,280
9Jul 14, 2025 22:09121,577618,760,966594,730,000999,0002,273,280