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 listSep 25, 2026 04:47Andrew EpsteinAndrew EpsteinScore: 31,129Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 04:4831,125163,639,776151,402,0001,113,0002,113,536
2Sep 25, 2026 04:4831,125162,923,834151,404,0001,109,0002,113,536
3Sep 25, 2026 04:4831,126162,945,779151,387,0001,134,0002,113,536
4Sep 25, 2026 04:4831,127162,937,752151,415,0001,108,0002,113,536
5Sep 25, 2026 04:4831,129163,153,820151,417,0001,117,0002,113,536
6Sep 25, 2026 04:4831,134163,106,181151,444,0001,114,0002,113,536
7Sep 25, 2026 04:4831,136163,255,840151,433,0001,137,0002,113,536
8Sep 25, 2026 04:4831,138163,154,313151,444,0001,135,0002,113,536
9Sep 25, 2026 04:4831,139162,985,228151,474,0001,110,0002,113,536