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 17, 2026 01:53M-RochatM-RochatScore: 19,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:5419,945175,144,073164,434,0001,110,0002,113,536
2May 17, 2026 01:5419,957174,459,280164,439,0001,206,0002,113,536
3May 17, 2026 01:5419,958176,276,389164,499,0001,159,0002,113,536
4May 17, 2026 01:5419,977174,599,052164,687,0001,125,0002,113,536
5May 17, 2026 01:5419,993175,727,573164,768,0001,177,0002,113,536
6May 17, 2026 01:5419,995176,283,644164,752,0001,214,0002,113,536
7May 17, 2026 01:5420,049175,320,868165,168,0001,244,0002,113,536
8May 17, 2026 01:5420,074178,181,791165,410,0001,205,0002,113,536
9May 17, 2026 01:5420,194178,067,695166,424,0001,189,0002,113,536