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 listDec 30, 2022 01:33Alexander KimAlexander KimScore: 22,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2022 01:3322,570249,649,094187,327,45002,203,648
2Dec 30, 2022 01:3322,591270,872,092187,505,28102,203,648
3Dec 30, 2022 01:3322,611257,455,490187,673,10402,195,456
4Dec 30, 2022 01:3322,619212,616,060185,740,0001,997,0002,437,120
5Dec 30, 2022 01:3322,620214,467,866184,753,0002,996,0002,326,528
6Dec 30, 2022 01:3322,622210,633,438186,763,000998,0002,326,528
7Dec 30, 2022 01:3322,622210,739,368185,763,0001,997,0002,379,776
8Dec 30, 2022 01:3322,622215,594,005185,764,0001,997,0002,457,600
9Dec 30, 2022 01:3322,623213,834,640184,772,0002,996,0002,387,968
10Dec 30, 2022 01:3322,636212,150,377183,883,0003,997,0002,375,680
11Dec 30, 2022 01:3322,643211,106,143184,942,0002,999,0002,437,120
12Dec 30, 2022 01:3322,655218,616,265185,037,0003,000,0002,506,752