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:39Victor 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:397,91574,850,36165,701,00002,113,536
2May 13, 2026 11:397,91778,404,66565,713,00002,113,536
3May 13, 2026 11:397,92074,709,61765,741,00002,113,536
4May 13, 2026 11:397,92474,653,11565,770,00002,113,536
5May 13, 2026 11:397,92773,021,61064,775,0001,020,0002,113,536
6May 13, 2026 11:397,92773,097,48865,798,00002,113,536
7May 13, 2026 11:397,92874,904,91764,773,0001,032,0002,113,536
8May 13, 2026 11:397,93074,783,64164,798,0001,022,0002,113,536
9May 13, 2026 11:398,08877,258,63866,114,0001,020,0002,113,536