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 15:45wnwnScore: 98,539Success
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 15:4698,462490,908,961481,463,0001,004,0002,113,536
2May 11, 2026 15:4698,505493,111,764481,674,0001,004,0002,113,536
3May 11, 2026 15:4698,508490,730,887480,652,0002,042,0002,113,536
4May 11, 2026 15:4698,526491,065,400481,775,0001,005,0002,113,536
5May 11, 2026 15:4698,539491,755,078481,840,0001,004,0002,113,536
6May 11, 2026 15:4698,591492,704,848482,096,0001,004,0002,113,536
7May 11, 2026 15:4698,631500,274,293482,292,0001,003,0002,113,536
8May 11, 2026 15:4698,668491,362,860482,471,0001,004,0002,113,536
9May 11, 2026 15:4698,880492,266,923483,512,0001,004,0002,113,536