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 17:03anboto1anboto1Score: 64,446Success
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 17:0464,382325,854,716314,361,0001,111,0002,113,536
2Aug 2, 2026 17:0464,409325,653,902314,494,0001,114,0002,113,536
3Aug 2, 2026 17:0464,421326,230,337314,561,0001,102,0002,113,536
4Aug 2, 2026 17:0464,437325,769,235314,633,0001,112,0002,113,536
5Aug 2, 2026 17:0464,446325,848,739314,670,0001,119,0002,113,536
6Aug 2, 2026 17:0464,705327,122,251315,926,0001,133,0002,113,536
7Aug 2, 2026 17:0466,699337,490,830325,701,0001,127,0002,113,536
8Aug 2, 2026 17:0467,751342,093,698330,861,0001,119,0002,113,536
9Aug 2, 2026 17:0468,163343,974,017332,884,0001,115,0002,113,536