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 listAug 3, 2026 21:03anboto1anboto1Score: 58,371Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:0557,954292,934,196282,967,0001,010,0002,113,536
2Aug 3, 2026 21:0557,984293,182,665283,034,0001,090,0002,113,536
3Aug 3, 2026 21:0558,173293,487,598283,934,0001,118,0002,113,536
4Aug 3, 2026 21:0558,195293,727,624284,056,0001,100,0002,113,536
5Aug 3, 2026 21:0558,371294,454,914284,915,0001,106,0002,113,536
6Aug 3, 2026 21:0558,666296,519,062286,373,0001,091,0002,113,536
7Aug 3, 2026 21:0558,670295,630,709286,393,0001,094,0002,113,536
8Aug 3, 2026 21:0558,927297,827,897287,739,0001,006,0002,113,536
9Aug 3, 2026 21:0559,190299,103,997288,935,0001,100,0002,113,536