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 10, 2026 14:10Josu San MartinJosu San MartinScore: 4,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 14:114,18244,249,23233,661,0001,056,0002,113,536
2May 10, 2026 14:114,18342,107,14633,684,0001,039,0002,113,536
3May 10, 2026 14:114,18543,535,41633,678,0001,062,0002,113,536
4May 10, 2026 14:114,19042,284,70733,750,0001,027,0002,113,536
5May 10, 2026 14:114,19245,534,93533,755,0001,041,0002,113,536
6May 10, 2026 14:114,19243,971,81933,758,0001,043,0002,113,536
7May 10, 2026 14:114,19844,981,42933,805,0001,043,0002,113,536
8May 10, 2026 14:114,20742,237,25333,888,0001,038,0002,113,536
9May 10, 2026 14:114,21042,531,72733,903,0001,043,0002,113,536