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 20, 2026 11:58Victor MerckléVictor MerckléScore: 5,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 11:595,95057,234,24448,326,0001,059,0002,113,536
2May 20, 2026 11:595,96258,417,37548,430,0001,058,0002,113,536
3May 20, 2026 11:595,97357,841,84848,507,0001,075,0002,113,536
4May 20, 2026 11:595,97659,056,27448,581,0001,028,0002,113,536
5May 20, 2026 11:595,98059,384,94048,575,0001,064,0002,113,536
6May 20, 2026 11:595,98559,390,81848,615,0001,065,0002,113,536
7May 20, 2026 11:595,99259,860,51548,675,0001,066,0002,113,536
8May 20, 2026 11:596,01258,340,79448,794,0001,106,0002,113,536
9May 20, 2026 11:596,12859,368,25049,732,0001,138,0002,113,536