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 listSep 11, 2026 08:21C#_userC#_userScore: 188,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 08:22187,900931,175,844804,374,000116,339,0002,113,536
2Sep 11, 2026 08:22187,952931,434,060805,019,000115,949,0002,113,536
3Sep 11, 2026 08:22188,079932,662,097805,411,000116,180,0002,113,536
4Sep 11, 2026 08:22188,093932,933,269806,107,000115,550,0002,113,536
5Sep 11, 2026 08:22188,285933,622,188805,299,000117,300,0002,113,536
6Sep 11, 2026 08:22188,362934,061,266806,165,000116,810,0002,113,536
7Sep 11, 2026 08:22188,376934,213,584806,921,000116,122,0002,113,536
8Sep 11, 2026 08:22188,529935,259,419807,287,000116,509,0002,113,536
9Sep 11, 2026 08:22188,708935,201,976807,792,000116,881,0002,113,536