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 listJan 23, 2026 04:41Josu San MartinJosu San MartinScore: 98,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2026 04:4198,871512,849,535483,470,0001,000,0002,273,280
2Jan 23, 2026 04:4198,883515,255,938480,533,0003,996,0002,269,184
3Jan 23, 2026 04:4198,885512,254,631483,537,000999,0002,269,184
4Jan 23, 2026 04:4198,899512,074,338482,606,0001,998,0002,392,064
5Jan 23, 2026 04:4198,916511,250,020479,690,0004,996,0002,269,184
6Jan 23, 2026 04:4198,916513,601,853483,689,000999,0002,400,256
7Jan 23, 2026 04:4198,928513,911,072483,748,000999,0002,269,184
8Jan 23, 2026 04:4199,228507,702,189483,215,0003,001,0002,510,848
9Jan 23, 2026 04:4199,278514,179,615484,464,0001,997,0002,273,280