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 listAug 2, 2026 20:47George SeabridgeGeorge SeabridgeScore: 7,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:476,92567,500,38954,422,0003,057,0002,113,536
2Aug 2, 2026 20:476,93467,448,29654,437,0003,120,0002,113,536
3Aug 2, 2026 20:476,98467,912,69354,964,0003,011,0002,113,536
4Aug 2, 2026 20:477,03368,286,72356,320,0002,058,0002,113,536
5Aug 2, 2026 20:477,10368,904,18955,920,0003,036,0002,113,536
6Aug 2, 2026 20:477,12469,496,46656,056,0003,077,0002,113,536
7Aug 2, 2026 20:477,14469,258,79056,070,0003,230,0002,113,536
8Aug 2, 2026 20:477,17469,474,31256,497,0003,049,0002,113,536
9Aug 2, 2026 20:477,36971,064,34359,111,0002,056,0002,113,536