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 listJun 26, 2026 19:38A_ShamanA_ShamanScore: 205,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 19:40203,8701,008,767,441996,957,0002,009,0002,113,536
2Jun 26, 2026 19:40204,6241,012,089,075999,515,0003,147,0002,113,536
3Jun 26, 2026 19:40204,7061,012,427,447999,871,0003,193,0002,113,536
4Jun 26, 2026 19:40205,1821,015,172,3051,003,287,0002,107,0002,113,536
5Jun 26, 2026 19:40205,8501,018,128,7931,005,640,0003,026,0002,117,632
6Jun 26, 2026 19:40205,9471,018,514,0461,005,981,0003,161,0002,117,632
7Jun 26, 2026 19:40208,0721,029,434,3361,017,394,0002,163,0002,113,536
8Jun 26, 2026 19:40208,1011,029,582,8071,017,560,0002,138,0002,113,536
9Jun 26, 2026 19:40208,3941,032,154,4661,019,130,0002,004,0002,117,632