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 2, 2026 15:50anboto1anboto1Score: 70,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 15:5069,151348,908,726337,722,0001,118,0002,113,536
2Aug 2, 2026 15:5069,153348,939,067337,730,0001,121,0002,113,536
3Aug 2, 2026 15:5069,153348,886,119337,739,0001,113,0002,113,536
4Aug 2, 2026 15:5069,238349,313,688338,139,0001,128,0002,113,536
5Aug 2, 2026 15:5070,122353,651,764342,486,0001,113,0002,113,536
6Aug 2, 2026 15:5070,402354,949,236343,870,0001,102,0002,113,536
7Aug 2, 2026 15:5071,325359,546,868348,385,0001,110,0002,113,536
8Aug 2, 2026 15:5071,515360,421,734349,313,0001,115,0002,113,536
9Aug 2, 2026 15:5071,583360,826,598349,632,0001,125,0002,113,536