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 15:15Victor MerckléVictor MerckléScore: 24,727Success
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 15:1624,667214,075,522190,513,00014,226,0002,113,536
2May 19, 2026 15:1624,675214,669,345190,598,00014,209,0002,113,536
3May 19, 2026 15:1624,716212,978,092190,501,00014,645,0002,113,536
4May 19, 2026 15:1624,716212,914,284190,889,00014,259,0002,113,536
5May 19, 2026 15:1624,727215,058,766190,462,00014,778,0002,113,536
6May 19, 2026 15:1624,793215,297,634190,973,00014,809,0002,113,536
7May 19, 2026 15:1624,829213,938,322191,289,00014,796,0002,113,536
8May 19, 2026 15:1624,846215,767,104190,563,00015,659,0002,113,536
9May 19, 2026 15:1624,937216,951,150191,027,00015,957,0002,113,536