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 listAug 3, 2026 20:45anboto1anboto1Score: 57,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:4857,532291,104,447280,734,0001,175,0002,113,536
2Aug 3, 2026 20:4857,591291,265,586281,074,0001,122,0002,113,536
3Aug 3, 2026 20:4857,686291,731,240281,537,0001,129,0002,113,536
4Aug 3, 2026 20:4857,750292,008,695281,869,0001,110,0002,113,536
5Aug 3, 2026 20:4857,811292,407,704282,098,0001,179,0002,113,536
6Aug 3, 2026 20:4858,734296,932,125286,674,0001,126,0002,113,536
7Aug 3, 2026 20:4859,271299,520,936289,282,0001,149,0002,113,536
8Aug 3, 2026 20:4859,273300,115,141289,330,0001,112,0002,113,536
9Aug 3, 2026 20:4859,974308,198,223292,756,0001,120,0002,113,536