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 listJul 14, 2026 23:26Andrew TsibinAndrew TsibinScore: 5,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 23:264,91450,458,59939,767,0001,022,0002,113,536
2Jul 14, 2026 23:264,92750,525,64139,875,0001,022,0002,113,536
3Jul 14, 2026 23:264,96750,893,36740,203,0001,027,0002,113,536
4Jul 14, 2026 23:264,97050,835,09740,241,0001,010,0002,113,536
5Jul 14, 2026 23:265,02851,643,55740,721,0001,013,0002,113,536
6Jul 14, 2026 23:265,03151,433,71540,748,0001,015,0002,113,536
7Jul 14, 2026 23:265,03651,489,28140,792,0001,009,0002,113,536
8Jul 14, 2026 23:265,10251,903,97441,330,0001,019,0002,113,536
9Jul 14, 2026 23:265,14052,833,11841,635,0001,027,0002,113,536