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 10:56wnwnScore: 115,077Success
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 10:57114,872572,054,184560,720,0002,155,0002,113,536
2May 11, 2026 10:57114,882572,898,215560,814,0002,110,0002,113,536
3May 11, 2026 10:57114,885575,084,373560,916,0002,025,0002,113,536
4May 11, 2026 10:57115,001572,217,752561,502,0002,006,0002,113,536
5May 11, 2026 10:57115,077572,796,290561,777,0002,104,0002,113,536
6May 11, 2026 10:57115,157573,010,470562,005,0002,265,0002,113,536
7May 11, 2026 10:57115,176573,558,123562,115,0002,250,0002,113,536
8May 11, 2026 10:57115,221575,291,872562,581,0002,005,0002,113,536
9May 11, 2026 10:57115,227575,839,398562,606,0002,010,0002,113,536