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 listMay 11, 2026 13:48wnwnScore: 100,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 13:49100,896502,294,914493,390,0001,004,0002,113,536
2May 11, 2026 13:49100,903501,727,710493,425,0001,003,0002,113,536
3May 11, 2026 13:49100,911501,826,748493,461,0001,004,0002,113,536
4May 11, 2026 13:49100,931501,934,070493,560,0001,005,0002,113,536
5May 11, 2026 13:49100,953502,014,458493,666,0001,005,0002,113,536
6May 11, 2026 13:49101,017502,341,731493,983,0001,004,0002,113,536
7May 11, 2026 13:49101,021503,276,005494,001,0001,004,0002,113,536
8May 11, 2026 13:49101,151503,262,461494,637,0001,004,0002,113,536
9May 11, 2026 13:49102,898513,213,673503,199,0001,004,0002,113,536