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 listSep 5, 2021 12:11Sergey StreminSergey StreminScore: 22,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2021 12:1122,378251,567,189185,740,91402,228,224
2Sep 5, 2021 12:1122,391253,177,638185,846,24902,224,128
3Sep 5, 2021 12:1122,406267,988,233185,973,43802,220,032
4Sep 5, 2021 12:1122,441208,499,911184,256,0002,002,0002,281,472
5Sep 5, 2021 12:1122,458219,043,680185,397,0001,002,0002,281,472
6Sep 5, 2021 12:1122,470208,959,869186,502,00002,281,472
7Sep 5, 2021 12:1122,472215,025,412186,520,00002,375,680
8Sep 5, 2021 12:1122,474214,295,523186,536,00002,281,472
9Sep 5, 2021 12:1122,480213,880,400186,583,00002,281,472
10Sep 5, 2021 12:1122,503215,528,466184,776,0001,997,0002,355,200
11Sep 5, 2021 12:1122,988221,190,735189,805,000998,0002,498,560
12Sep 5, 2021 12:1123,000220,869,989189,905,000999,0002,281,472