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 18:42M-RochatM-RochatScore: 20,073Success
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 18:4219,887173,888,843164,035,0001,033,0002,113,536
2May 13, 2026 18:4219,924174,166,519164,327,0001,047,0002,113,536
3May 13, 2026 18:4219,941176,303,950164,496,0001,016,0002,113,536
4May 13, 2026 18:4220,047175,711,799165,380,0001,014,0002,113,536
5May 13, 2026 18:4220,073176,764,413165,577,0001,035,0002,113,536
6May 13, 2026 18:4220,271177,798,706167,234,0001,023,0002,113,536
7May 13, 2026 18:4220,343179,013,227167,815,0001,040,0002,113,536
8May 13, 2026 18:4220,345178,226,795167,848,0001,023,0002,113,536
9May 13, 2026 18:4220,678180,982,991170,561,0001,070,0002,113,536