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 19, 2026 12:09Victor MerckléVictor MerckléScore: 51,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 12:1051,518260,689,852250,419,0002,022,0002,113,536
2Jun 19, 2026 12:1051,565260,630,935250,662,0002,009,0002,113,536
3Jun 19, 2026 12:1051,590260,436,974250,736,0002,055,0002,113,536
4Jun 19, 2026 12:1051,592260,482,473250,730,0002,071,0002,113,536
5Jun 19, 2026 12:1051,614261,781,255250,664,0002,246,0002,113,536
6Jun 19, 2026 12:1051,649260,647,495251,009,0002,074,0002,113,536
7Jun 19, 2026 12:1051,675260,818,506251,186,0002,022,0002,113,536
8Jun 19, 2026 12:1051,746261,131,501251,520,0002,040,0002,113,536
9Jun 19, 2026 12:1052,308263,959,480254,223,0002,087,0002,113,536