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 listJul 31, 2026 19:57anboto1anboto1Score: 158,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:57157,721784,513,048771,595,0001,240,0002,113,536
2Jul 31, 2026 19:57157,805783,490,713771,987,0001,260,0002,113,536
3Jul 31, 2026 19:57157,947783,970,280772,687,0001,255,0002,113,536
4Jul 31, 2026 19:57157,967784,296,468772,810,0001,230,0002,113,536
5Jul 31, 2026 19:57158,223785,440,502774,054,0001,242,0002,113,536
6Jul 31, 2026 19:57158,466786,645,033775,234,0001,252,0002,113,536
7Jul 31, 2026 19:57158,537787,065,481775,590,0001,243,0002,113,536
8Jul 31, 2026 19:57158,841788,580,544777,069,0001,255,0002,113,536
9Jul 31, 2026 19:57158,876788,718,325777,257,0001,237,0002,113,536