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 20:43anboto1anboto1Score: 57,775Success
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 20:4657,525290,868,400280,779,0001,095,0002,113,536
2Aug 3, 2026 20:4657,553291,014,752280,920,0001,092,0002,113,536
3Aug 3, 2026 20:4657,567291,201,216280,903,0001,180,0002,113,536
4Aug 3, 2026 20:4657,641291,546,620281,275,0001,170,0002,113,536
5Aug 3, 2026 20:4657,775292,251,732281,976,0001,126,0002,113,536
6Aug 3, 2026 20:4659,056297,567,674288,229,0001,147,0002,113,536
7Aug 3, 2026 20:4659,089298,600,364288,424,0001,114,0002,113,536
8Aug 3, 2026 20:4659,149298,952,017288,737,0001,094,0002,113,536
9Aug 3, 2026 20:4659,172299,055,407288,726,0001,221,0002,113,536