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 20:08anboto1anboto1Score: 159,418Success
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 20:08158,327785,907,497773,669,0002,134,0002,113,536
2Jul 31, 2026 20:08158,582787,002,661776,004,0001,050,0002,113,536
3Jul 31, 2026 20:08158,646787,468,237776,295,0001,073,0002,113,536
4Jul 31, 2026 20:08159,416792,254,411780,072,0001,067,0002,113,536
5Jul 31, 2026 20:08159,418791,272,494780,091,0001,058,0002,113,536
6Jul 31, 2026 20:08159,510791,692,894780,528,0001,075,0002,113,536
7Jul 31, 2026 20:08159,928793,681,030782,592,0001,059,0002,113,536
8Jul 31, 2026 20:08159,941793,639,675782,662,0001,051,0002,113,536
9Jul 31, 2026 20:08160,285795,351,799784,322,0001,075,0002,113,536