Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 19, 2026 16:31Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 16:31071,680,29461,952,0001,007,0002,113,536expected "53682155747728175 ", got "53682160129593228 "
2May 19, 2026 16:317,58773,461,88161,953,0001,025,0002,113,536
3May 19, 2026 16:317,59473,043,13562,005,0001,026,0002,113,536
4May 19, 2026 16:317,60573,850,03462,041,0001,088,0002,113,536
5May 19, 2026 16:317,61271,113,85562,159,0001,024,0002,113,536
6May 19, 2026 16:317,63671,964,78562,360,0001,020,0002,113,536
7May 19, 2026 16:317,71273,730,03562,974,0001,038,0002,113,536
8May 19, 2026 16:317,76774,203,06063,446,0001,028,0002,113,536
9May 19, 2026 16:317,94775,670,26264,947,0001,019,0002,113,536