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:40wnwnScore: 98,880Success
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:4298,610493,610,531482,189,0001,004,0002,113,536
2May 11, 2026 10:4298,624491,945,346481,184,0002,075,0002,113,536
3May 11, 2026 10:4298,655503,386,398481,372,0002,038,0002,113,536
4May 11, 2026 10:4298,714492,401,722482,699,0001,004,0002,113,536
5May 11, 2026 10:4298,880495,543,708482,493,0002,022,0002,113,536
6May 11, 2026 10:4299,139507,721,021483,771,0002,011,0002,113,536
7May 11, 2026 10:4299,145494,458,255484,807,0001,005,0002,113,536
8May 11, 2026 10:4299,186494,755,151483,959,0002,054,0002,113,536
9May 11, 2026 10:4299,249495,617,146484,302,0002,022,0002,113,536