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 listMay 11, 2026 13:17wnwnScore: 98,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 13:2198,252491,560,120479,403,0002,032,0002,113,536
2May 11, 2026 13:2198,311492,854,251479,594,0002,134,0002,113,536
3May 11, 2026 13:2198,311502,688,363479,575,0002,152,0002,113,536
4May 11, 2026 13:2198,349492,563,807479,863,0002,051,0002,113,536
5May 11, 2026 13:2198,368492,831,601479,982,0002,022,0002,113,536
6May 11, 2026 13:2198,759492,631,876481,871,0002,049,0002,113,536
7May 11, 2026 13:2198,793494,200,026481,985,0002,105,0002,113,536
8May 11, 2026 13:2198,924493,542,921482,474,0002,254,0002,113,536
9May 11, 2026 13:2198,963507,219,299482,873,0002,050,0002,113,536