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 17:48George SeabridgeGeorge SeabridgeScore: 7,389Success
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 17:486,67166,067,70352,346,0003,027,0002,113,536
2Aug 2, 2026 17:486,71266,350,73053,467,0002,243,0002,113,536
3Aug 2, 2026 17:487,27771,066,81858,136,0002,265,0002,113,536
4Aug 2, 2026 17:487,38271,926,29358,230,0003,044,0002,113,536
5Aug 2, 2026 17:487,38971,922,97559,127,0002,207,0002,113,536
6Aug 2, 2026 17:487,39172,018,69659,141,0002,210,0002,113,536
7Aug 2, 2026 17:487,41371,759,91059,323,0002,208,0002,113,536
8Aug 2, 2026 17:487,41872,254,06359,284,0002,293,0002,113,536
9Aug 2, 2026 17:487,43072,260,68359,452,0002,217,0002,113,536