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 11, 2024 22:13Dmitrii KravchenkoDmitrii KravchenkoScore: 63,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2024 22:1363,765554,093,065528,253,0001,000,0002,289,664
2Sep 11, 2024 22:1363,778563,865,164528,357,0001,000,0002,531,328
3Sep 11, 2024 22:1363,804556,834,055527,573,0001,998,0002,281,472
4Sep 11, 2024 22:1363,806559,560,609528,587,000999,0002,289,664
5Sep 11, 2024 22:1363,807559,528,981529,601,00002,277,376
6Sep 11, 2024 22:1363,809557,929,278527,615,0001,998,0002,289,664
7Sep 11, 2024 22:1363,810554,688,817527,621,0001,998,0002,289,664
8Sep 11, 2024 22:1363,810561,208,513529,621,00002,289,664
9Sep 11, 2024 22:1363,824557,560,575527,744,0001,999,0002,289,664