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 10:36wnwnScore: 99,655Success
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 10:3799,045495,122,097483,312,0002,013,0002,113,536
2May 11, 2026 10:3799,078495,813,618483,480,0002,007,0002,113,536
3May 11, 2026 10:3799,094495,825,151483,531,0002,033,0002,113,536
4May 11, 2026 10:3799,256497,928,834484,288,0002,067,0002,113,536
5May 11, 2026 10:3799,655498,923,214486,304,0002,008,0002,113,536
6May 11, 2026 10:3799,668499,303,275486,292,0002,086,0002,113,536
7May 11, 2026 10:3799,669498,837,570486,328,0002,051,0002,113,536
8May 11, 2026 10:3799,777497,674,748486,895,0002,015,0002,113,536
9May 11, 2026 10:37167,863831,904,123820,381,0002,150,0002,113,536