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 listJun 20, 2026 01:47Victor MerckléVictor MerckléScore: 51,140Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 01:4851,082257,938,404248,297,0002,009,0002,113,536
2Jun 20, 2026 01:4851,119258,131,429248,348,0002,137,0002,113,536
3Jun 20, 2026 01:4851,125258,119,286248,493,0002,020,0002,113,536
4Jun 20, 2026 01:4851,135259,312,692248,429,0002,133,0002,113,536
5Jun 20, 2026 01:4851,140258,190,485248,430,0002,157,0002,113,536
6Jun 20, 2026 01:4851,151258,256,329248,520,0002,124,0002,113,536
7Jun 20, 2026 01:4851,152258,290,937248,507,0002,140,0002,113,536
8Jun 20, 2026 01:4851,389259,439,560249,674,0002,135,0002,113,536
9Jun 20, 2026 01:4851,651260,727,149251,003,0002,090,0002,113,536