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 16, 2026 21:38M-RochatM-RochatScore: 123,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 21:49122,612609,919,902598,756,0002,047,0002,113,536
2May 16, 2026 21:49122,904611,110,435600,209,0002,025,0002,113,536
3May 16, 2026 21:49123,082613,779,626601,019,0002,083,0002,113,536
4May 16, 2026 21:49123,178614,588,804601,565,0002,010,0002,113,536
5May 16, 2026 21:49123,384613,420,018602,543,0002,043,0002,113,536
6May 16, 2026 21:49123,486614,941,076603,071,0002,012,0002,113,536
7May 16, 2026 21:49124,777625,961,020609,363,0002,049,0002,113,536
8May 16, 2026 21:49124,977621,488,202610,346,0002,042,0002,113,536
9May 16, 2026 21:49125,037622,871,165610,506,0002,179,0002,113,536