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 listJul 31, 2026 17:54anboto1anboto1Score: 184,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:55184,443913,784,774902,683,0001,091,0002,113,536
2Jul 31, 2026 17:55184,491914,095,914902,931,0001,079,0002,113,536
3Jul 31, 2026 17:55184,536915,066,671903,130,0001,099,0002,113,536
4Jul 31, 2026 17:55184,569914,495,590903,314,0001,076,0002,113,536
5Jul 31, 2026 17:55184,683915,768,543903,833,0001,115,0002,113,536
6Jul 31, 2026 17:55184,705914,904,499903,965,0001,090,0002,113,536
7Jul 31, 2026 17:55184,767915,298,397904,276,0001,086,0002,113,536
8Jul 31, 2026 17:55184,855915,899,750904,696,0001,097,0002,113,536
9Jul 31, 2026 17:55184,950916,154,104905,167,0001,090,0002,113,536