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 17:52Victor MerckléVictor MerckléScore: 4,606Success
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 17:534,57647,915,68736,919,0001,068,0002,113,536
2May 24, 2026 17:534,58245,963,66136,958,0001,075,0002,113,536
3May 24, 2026 17:534,58648,973,91936,991,0001,077,0002,113,536
4May 24, 2026 17:534,58947,765,54337,033,0001,062,0002,113,536
5May 24, 2026 17:534,60646,209,42437,231,0001,007,0002,113,536
6May 24, 2026 17:534,61147,893,44637,263,0001,015,0002,113,536
7May 24, 2026 17:534,61946,271,46937,258,0001,082,0002,113,536
8May 24, 2026 17:534,62848,464,53237,279,0001,140,0002,113,536
9May 24, 2026 17:534,63146,259,25937,434,0001,005,0002,113,536