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 21, 2024 09:11mahdi739mahdi739Score: 63,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2024 09:1163,829556,700,669527,784,0001,999,0002,285,568
2Dec 21, 2024 09:1163,842553,057,122527,893,0001,999,0002,285,568
3Dec 21, 2024 09:1163,842550,130,229527,891,0001,999,0002,281,472
4Dec 21, 2024 09:1163,844556,694,185527,903,0001,999,0002,371,584
5Dec 21, 2024 09:1163,845553,515,790527,917,0001,999,0002,285,568
6Dec 21, 2024 09:1163,857554,064,798530,009,00002,285,568
7Dec 21, 2024 09:1163,872557,704,960529,141,0001,000,0002,465,792
8Dec 21, 2024 09:1163,874555,235,798528,157,0002,000,0002,285,568
9Dec 21, 2024 09:1163,877554,170,902529,179,0001,000,0002,363,392