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:11anboto1anboto1Score: 57,739Success
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:1257,593291,272,125281,072,0001,137,0002,113,536
2Aug 3, 2026 20:1257,612290,774,658281,218,0001,081,0002,113,536
3Aug 3, 2026 20:1257,615290,838,150281,179,0001,135,0002,113,536
4Aug 3, 2026 20:1257,738291,935,122281,825,0001,094,0002,113,536
5Aug 3, 2026 20:1257,739292,067,867281,795,0001,130,0002,113,536
6Aug 3, 2026 20:1257,795292,265,202282,092,0001,106,0002,113,536
7Aug 3, 2026 20:1257,808291,952,180282,140,0001,120,0002,113,536
8Aug 3, 2026 20:1258,525295,710,589285,673,0001,100,0002,113,536
9Aug 3, 2026 20:1258,831296,686,950287,122,0001,150,0002,113,536