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 17, 2026 12:13M-RochatM-RochatScore: 123,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 12:14118,255588,379,796578,264,0001,189,0002,113,536
2May 17, 2026 12:14119,032593,224,750582,066,0001,194,0002,113,536
3May 17, 2026 12:14121,765607,753,877595,643,0001,007,0002,113,536
4May 17, 2026 12:14122,663609,863,730599,865,0001,188,0002,113,536
5May 17, 2026 12:14123,592615,729,297604,406,0001,196,0002,113,536
6May 17, 2026 12:14124,157617,200,889607,185,0001,189,0002,113,536
7May 17, 2026 12:14124,218619,920,153607,468,0001,202,0002,113,536
8May 17, 2026 12:14125,098625,125,300611,982,0001,002,0002,113,536
9May 17, 2026 12:14125,920626,713,602615,810,0001,198,0002,113,536