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:40anboto1anboto1Score: 57,830Success
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:4257,746293,621,436281,824,0001,135,0002,113,536
2Aug 3, 2026 20:4257,761291,520,271281,898,0001,134,0002,113,536
3Aug 3, 2026 20:4257,777291,527,572281,917,0001,192,0002,113,536
4Aug 3, 2026 20:4257,819292,395,938282,039,0001,275,0002,113,536
5Aug 3, 2026 20:4257,830291,840,676282,206,0001,162,0002,113,536
6Aug 3, 2026 20:4257,863292,645,843282,409,0001,122,0002,113,536
7Aug 3, 2026 20:4257,922292,231,910282,713,0001,108,0002,113,536
8Aug 3, 2026 20:4258,488295,196,652285,418,0001,174,0002,113,536
9Aug 3, 2026 20:4258,695296,699,341286,514,0001,093,0002,113,536