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 24, 2026 15:04Victor MerckléVictor MerckléScore: 22,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 15:0522,236192,542,686183,464,0001,096,0002,113,536
2May 24, 2026 15:0522,253192,528,265183,632,0001,070,0002,113,536
3May 24, 2026 15:0522,258192,635,577183,702,0001,046,0002,113,536
4May 24, 2026 15:0522,277192,536,116183,834,0001,067,0002,113,536
5May 24, 2026 15:0522,279193,474,424183,848,0001,073,0002,113,536
6May 24, 2026 15:0522,313196,250,906184,130,0001,072,0002,113,536
7May 24, 2026 15:0522,343193,273,609184,415,0001,034,0002,113,536
8May 24, 2026 15:0522,351194,533,946184,481,0001,034,0002,113,536
9May 24, 2026 15:0522,604195,937,479186,576,0001,045,0002,113,536