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 listNov 12, 2025 00:53izotoffizotoffScore: 469,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 00:53468,7352,331,034,8782,289,804,0006,999,0002,330,624
2Nov 12, 2025 00:53469,6012,329,947,4952,295,050,0005,994,0002,322,432
3Nov 12, 2025 00:53469,7002,332,027,9532,298,530,0002,998,0002,322,432
4Nov 12, 2025 00:53469,7072,329,540,5882,297,568,0003,997,0002,322,432
5Nov 12, 2025 00:53469,7142,330,975,3572,294,606,0006,995,0002,551,808
6Nov 12, 2025 00:53469,7212,327,429,7742,298,635,0002,998,0002,326,528
7Nov 12, 2025 00:53469,7362,326,159,1612,296,709,0004,997,0002,424,832
8Nov 12, 2025 00:53469,7362,330,917,0182,291,714,0009,994,0002,326,528
9Nov 12, 2025 00:53469,7792,332,323,6122,294,923,0006,996,0002,428,928