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:45anboto1anboto1Score: 59,069Success
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:4658,998297,620,578288,057,0001,038,0002,113,536
2Aug 3, 2026 21:4659,065297,938,998288,300,0001,120,0002,113,536
3Aug 3, 2026 21:4659,066298,478,265288,312,0001,112,0002,113,536
4Aug 3, 2026 21:4659,068297,967,801288,240,0001,195,0002,113,536
5Aug 3, 2026 21:4659,069298,467,681288,354,0001,088,0002,113,536
6Aug 3, 2026 21:4659,072298,519,663288,344,0001,113,0002,113,536
7Aug 3, 2026 21:4659,092298,015,465288,448,0001,107,0002,113,536
8Aug 3, 2026 21:4660,074302,804,444293,258,0001,105,0002,113,536
9Aug 3, 2026 21:4661,203308,462,737298,731,0001,164,0002,113,536