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 24, 2026 19:10Andrew EpsteinAndrew EpsteinScore: 151,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 19:10151,840754,431,842742,908,0001,110,0002,117,632stderr
2Sep 24, 2026 19:10151,865754,601,149743,044,0001,099,0002,117,632stderr
3Sep 24, 2026 19:10151,875754,715,388743,078,0001,112,0002,117,632stderr
4Sep 24, 2026 19:10151,891754,687,795743,174,0001,095,0002,117,632stderr
5Sep 24, 2026 19:10151,930755,803,087742,346,0002,113,0002,117,632stderr
6Sep 24, 2026 19:10151,940754,892,980743,397,0001,110,0002,117,632stderr
7Sep 24, 2026 19:10151,958755,792,209743,480,0001,118,0002,117,632stderr
8Sep 24, 2026 19:10151,959755,883,750743,489,0001,113,0002,117,632stderr
9Sep 24, 2026 19:10151,981756,065,623743,595,0001,116,0002,117,632stderr