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 listFeb 3, 2026 21:49olliecrowolliecrowScore: 213,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 21:49213,1491,066,013,4241,041,431,0002,998,0002,416,640
2Feb 3, 2026 21:49213,5321,069,295,3501,044,311,0001,998,0002,392,064
3Feb 3, 2026 21:49215,0291,082,083,5601,049,644,0003,998,0002,445,312