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 13, 2026 11:50Victor MerckléVictor MerckléScore: 7,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 11:507,91775,039,71865,718,00002,113,536
2May 13, 2026 11:507,91973,675,18764,693,0001,042,0002,113,536
3May 13, 2026 11:507,92273,631,38064,743,0001,012,0002,113,536
4May 13, 2026 11:507,92576,117,77464,736,0001,045,0002,113,536
5May 13, 2026 11:507,92773,081,89464,763,0001,038,0002,113,536
6May 13, 2026 11:507,92975,549,58164,808,0001,010,0002,113,536
7May 13, 2026 11:507,93073,809,09964,816,0001,005,0002,113,536
8May 13, 2026 11:507,93274,068,43064,815,0001,027,0002,113,536
9May 13, 2026 11:507,93676,094,24464,817,0001,053,0002,113,536