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:42anboto1anboto1Score: 57,673Success
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:4457,577290,568,766281,099,0001,030,0002,113,536
2Aug 3, 2026 20:4457,610291,354,633281,171,0001,118,0002,113,536
3Aug 3, 2026 20:4457,637291,494,867281,171,0001,253,0002,113,536
4Aug 3, 2026 20:4457,665291,645,654281,452,0001,110,0002,113,536
5Aug 3, 2026 20:4457,673291,670,119281,497,0001,102,0002,113,536
6Aug 3, 2026 20:4457,848291,893,231282,348,0001,112,0002,113,536
7Aug 3, 2026 20:4457,911292,828,389282,578,0001,187,0002,113,536
8Aug 3, 2026 20:4458,206294,354,624284,076,0001,134,0002,113,536
9Aug 3, 2026 20:4458,287294,033,698284,487,0001,120,0002,113,536